Unicyclic graph
= Unicyclic graph
A <unicyclic graph> is a <connected graph> with exactly one <graph cycle>. Deleting the <edges> of that <graph cycle> leaves <trees>, each meeting it in exactly one <vertex>. Otherwise a surviving <graph cycle>, or a <graph path> between two <vertices> of the original <graph cycle>, would give another <graph cycle>. Thus a finite <unicyclic graph> is a <cycle graph> with <rooted trees> attached at its <vertices>.