Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n = 5, 7, 9, ... to all integer n>=5. They are illustrated above for n = 5 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 define a flower graph as a graph obtained by connecting the first vertex of a chain with p - 1 vertices to the root vertex of an m-ary tree of depth one. The vertices of this graph can be indexed so that vertices 1 to p correspond to "stem vertices" and vertices p + 1 to p + m to "petals."