Let C t be a cycle of length t, and let P 1 , . . . , P t be t polygon chains. A polygon flower F = (C t ; P 1 , . . . , P t ) is a graph obtained by identifying the ith edge of C t with an edge e i that belongs to an end-polygon of P i for i = 1, . . . , t. In this paper, we first give an explicit formula for the sandpile group S(F ) of F , which shows that the structure of S(F ) only depends on the numbers of spanning trees of P i and P i /e i , i = 1, . . . , t. By analyzing the arithmetic properties of those numbers, we give a simple formula for the minimum number of generators of S(F ), by which a sufficient and necessary condition for S(F ) being cyclic is obtained. Finally, we obtain a classification of edges that generate the sandpile group.Although the main results concern only a class of outerplanar graphs, the proof methods used in the paper may be of much more general interest. We make use of the graph structure to find a set of generators and a relation matrix R, which has the same form for any F and has much smaller size than that of the (reduced) Laplacian matrix, which is the most popular relation matrix used to study the sandpile group of a graph.