 Unicyclic component

A connected graph is unicyclic when it contains exactly one cycle, equivalently when its numbers of vertices and edges agree.

A pseudoforest permits both these components and acyclic tree components.