Flower graphs are a name given in this work to the generalization of the flower snarks for positive , 7, 9, ... to all integer . They are illustrated above for to 9. Flower graphs are unit-distance.

Precomputed properties of flower graphs are implemented in the Wolfram Language as `GraphData`[`"Flower"`, *n*].

Different graphs are sometimes termed flower graphs by various authors.

Herbster and Pontil (2006) define a flower graph as a graph obtained by connecting the first vertex of a chain with vertices to the root vertex of an -ary tree of depth one. The vertices of this graph can be indexed so that vertices 1 to correspond to "stem vertices" and vertices to to "petals."

Seoud and Youssef (2017) define a flower graph as the graph obtained from a helm graph by joining each pendent vertex to the central vertex (Gallian 2018).