Bouquet graph
= Bouquet graph
{title2=$B_j$}
A bouquet graph consists of one vertex and $j$ <self-loops>. Its vertex has degree $2j$, and its <graph excess> is $j-1$. The two-loop bouquet is one of the three possible kernels of a <bicyclic graph>; in a simple subdivision, each loop must expand to a cycle of length at least three.