Download Wolfram Notebook

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph (Gardner 1983) and Petersen graph. A graph that cannot be gracefully labeled is called an ungraceful (or sometimes disgraceful) graph.

Graceful graphs may be connected or disconnected; for example, the graph disjoint union of the singleton graph and a complete graph is graceful iff or .

Although an unpublished result of Erdős says that most graphs are not graceful (Graham and Sloane 1980), most graphs that have some sort of regularity of structure are graceful (Gallian 2026).

It is an unsolved and apparently very difficult problem to determine which graphs are graceful. One reason for its difficulty is that a subgraph of a graceful graph need not be graceful (Seoud and Wilson 1993).

In order for a graph to be graceful, it must be without loops or multiple edges. A graph on vertices and edges must also satisfy

in order to be graceful, since otherwise there are not enough integers less than or equal to to cover all the vertices. Another criterion for determining that a graph is ungraceful is due to Rosa (1967), who proved that an Eulerian graph with edge count congruent to 1 or 2 (mod 4) is ungraceful.

The numbers of nonisomorphic graceful graphs on , 2, ... nodes are 1, 1, 2, 7, 22, 126, ... (OEIS A308548), while the corresponding numbers of connected graceful graphs are 1, 1, 2, 6, 18, 106, ... (OEIS A308549). The numbers of ungraceful graphs on , 2, ... nodes are 0, 1, 2, 4, 12, 30, 85, ... (OEIS A308556), with the corresponding numbers of connected ungraceful graphs 0, 0, 0, 0, 3, 6, 34, ... (OEIS A308557), the first few of which are illustrated above.

Pegg (2019) considered the minimum edge count of a graceful regular graph with vertex degree . For , 1, ..., the known values begin 0, 1, 3, 6, 12, 20, 27, 35, 48, 63, 75, 99, 108, ... (OEIS A308722), and Pegg (2019) verified . Knuth (2025, §7.2.2.3, Exercise 93 and its answer) considers how to enumerate the graceful labelings of regular graphs with prescribed edge count and vertex degree. This problem is related to sparse rulers. The graph vertex labels of a graceful regular graph with edges and vertex degree give distinct integer marks whose pairwise differences have absolute values including every distance from 1 through . A single pair must be selected for each distance so that every graph vertex belongs to exactly selected pairs (Pegg 2019, 2024).

Pegg (2019, 2024) conjectured that for . However, S. Li proved that no graceful regular graph with vertex degree 16 and edge count 192 exists, thereby refuting this conjecture (D. E. Knuth, pers. comm. to S. Li, Oct. 5, 2026). As of that communication, existence remained open for graceful regular graphs with vertex degree 16 and edge count 200, or vertex degree 18 and edge count 243. These graphs would have vertex count 25 and 27, respectively (D. E. Knuth, pers. comm. to S. Li, Oct. 5, 2026).

A graph that contains a single fundamentally distinct graceful labeling (i.e., a unique graceful labeling modulo the graph automorphism group and with respect to subtractive complementation) may be termed a uniquely graceful graph, and a graph possessing the maximum possible number of fundamentally distinct graceful labelings (possibly subject to some additional condition such as possessing no isolated vertices) may be termed a maximally graceful graph.

Parametrized families of graceful graphs include the following:

1. antiprism graphs,

2. banana trees,

3. book graphs ,

4. Cameron graphs,

5. caterpillar graphs,

6. complete graphs iff (Golomb 1974),

7. complete bipartite graphs (Golomb 1974),

8. crossed prism graphs,

9. cycle graphs iff ,

10. firecracker graphs,

11. gear graphs,

12. grid graphs ,

13. helm graphs,

14. hypercube graphs ,

15. ladder graphs ,

16. Lindgren-Sousselier graphs,

17. Möbius ladders ,

18. Mongolian tent graphs,

19. pan graphs,

20. path graphs ,

21. Platonic graphs (Gardner 1983, pp. 158 and 163-164),

22. prism graphs ,

23. star graphs ,

24. sunlet graphs ,

25. tadpole graphs,

26. web graphs, and

27. wheel graphs (Frucht 1988).

The -barbell graph is ungraceful from up to at least (E. Weisstein, Sep. 19, 2025) and likely for all larger .

In 1965, Kotzig conjectured that all trees are graceful, an almost certainly true conjecture known as the graceful tree conjecture that remains unproven to this day.

It has also been conjectured that all connected unicyclic graphs except the cycle graph with or 2 (mod 4) are graceful (Truszczyński 1984, Gallian 2026).

See also

Edge-Graceful Graph, Graceful Labeling, Graceful Permutation, Graceful Pi-Way, Graceful Tree Conjecture, Harmonious Graph, Labeled Graph, Maximally Graceful Graph, Regular Graph, Sparse Ruler, Ungraceful Graph, Uniquely Graceful Graph

Explore with Wolfram|Alpha

References

Abraham, J. and Kotzig, A. "Extensions of Graceful Valuations of 2-Regular Graphs Consisting of 4-Gons." Ars Combin. 32, 257-262, 1991.Abraham, J. and Kotzig, A. "All 2-Regular Graphs Consisting of 4-Cycles are Graceful." Disc. Math. 135, 1-24, 1994.Aldred, R. E. L. and McKay, B. "Graceful and Harmonious Labellings of Trees." Bull. Inst. Combin. Appl. 23, 69-72, 1998.Bloom, G. S. and Golomb, S. W. "Applications of Numbered Unidirected Graphs." Proc. IEEE 65, 562-570, 1977.Bolian, L. and Xiankun, Z. "On Harmonious Labellings of Graphs." Ars Combin. 36, 315-326, 1993.Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 248, 1976.Brualdi, R. A. and McDougal, K. F. "Semibandwidth of Bipartite Graphs and Matrices." Ars Combin. 30, 275-287, 1990.Brundage, M. "Graceful Graphs." http://www.qbrundage.com/michaelb/pubs/graceful/Cahit, I. "Are All Complete Binary Trees Graceful?" Amer. Math. Monthly 83, 35-37, 1976.Delorme, C.; Maheo, M.; Thuillier, H.; Koh, K. M.; and Teo, H. K. "Cycles with a Chord Are Graceful." J. Graph Th. 4, 409-415, 1980.Eshghi, K. and Azimi, P. "Applications of Mathematical Programming in Graceful Labeling of Graphs." J. Appl. Math. 2004, no. 1, 1-8, 2004.Frucht, R. W. and Gallian, J. A. "Labelling Prisms." Ars Combin. 26, 69-82, 1988.Gallian, J. A. §§1 and 2.2 in "A Dynamic Survey of Graph Labeling." Elec. J. Combin., Dynamic Survey DS6, Nov. 6, 2026. https://doi.org/10.37236/27.Gallian, J. A. "A Survey: Recent Results, Conjectures, and Open Problems in Labelling Graphs." J. Graph Th. 13, 491-504, 1989.Gallian, J. A. "Open Problems in Grid Labeling." Amer. Math. Monthly 97, 133-135, 1990.Gallian, J. A. "A Guide to the Graph Labelling Zoo." Disc. Appl. Math. 49, 213-229, 1994.Gallian, J. A.; Prout, J.; and Winters, S. "Graceful and Harmonious Labellings of Prism Related Graphs." Ars Combin. 34, 213-222, 1992.Gardner, M. "Mathematical Games: The Graceful Graphs of Solomon Golomb, or How to Number a Graph Parsimoniously." Sci. Amer. 226, No. 3, 108-113, March 1972.Gardner, M. "Golomb's Graceful Graphs." Ch. 15 in Wheels, Life, and Other Mathematical Amusements. New York: W. H. Freeman, pp. 152-165, 1983.Golomb, S. W. "How to Number a Graph." In Graph Theory and Computing (Ed. R. C. Read). New York: Academic Press, pp. 23-37, 1972.Golomb, S. W. "The Largest Graceful Subgraph of the Complete Graph." Amer. Math. Monthly 81, 499-501, 1974.Graham, R. L. and Sloane, N. J. A. "On Additive Bases and Harmonious Graphs." SIAM J. Alg. Discrete Methods 1, 382-404, 1980.Guy, R. "Monthly Research Problems, 1969-75." Amer. Math. Monthly 82, 995-1004, 1975.Guy, R. "Monthly Research Problems, 1969-1979." Amer. Math. Monthly 86, 847-852, 1979.Guy, R. K. "The Corresponding Modular Covering Problem. Harmonious Labelling of Graphs." §C13 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 127-128, 1994.Horton, M. "Graceful Trees: Statistics and Algorithms." Bachelor of Computing with Honours thesis. Hobart, Tasmania, Australia: University of Tasmania, 2003. https://doi.org/10.25959/23212346.Huang, J. H. and Skiena, S. "Gracefully Labelling Prisms." Ars Combin. 38, 225-242, 1994.Jungreis, D. S. and Reid, M. "Labelling Grids." Ars Combin. 34, 167-182, 1992.Knuth, D. E. §7.2.2.3, including Exercise 93 and its answer, in The Art of Computer Programming, Vol. 4, Fascicle 7: Constraint Satisfaction. Boston, MA: Addison-Wesley, pp. 16-24, 121 and 178, 2025.Koh, K. M. and Punnim, N. "On Graceful Graphs: Cycles with 3-Consecutive Chords." Bull. Malaysian Math. Soc. 5, 49-64, 1982.Koh, K. M. and Yap, K. Y. "Graceful Numberings of Cycles with a -Chord." Bull. Inst. Math. Acad. Sinica 13, 41-48, 1985.Moulton, D. "Graceful Labellings of Triangular Snakes." Ars Combin. 28, 3-13, 1989.Nikoloski, Z.; Deo, N.; and Suraweera, F. "Generation of Graceful Trees." Congr. Numer. 157, 191-201, 2002.Pegg, E. Jr. "Graceful Graphs with Valence ." May 31, 2019. https://math.stackexchange.com/questions/3246000/graceful-graphs-with-valence-k.Pegg, E. Jr. "Does a 16-Valence 192-Edge Graceful Graph Exist?" Dec. 11, 2024. https://math.stackexchange.com/questions/5010303/does-a-16-valence-192-edge-graceful-graph-exist.Punnim, N. and Pabhapote, N. "On Graceful Graphs: Cycles with a -Chord, ." Ars Combin. A 23, 225-228, 1987.Rosa, A. "On Certain Valuations of the Vertices of a Graph." In Theory of Graphs, International Symposium, Rome, July 1966. New York: Gordon and Breach, pp. 349-355, 1967.Seoud, M. A. and Wilson, R. J. "Some Disgraceful Graphs." Int. J. Math. Educ. Sci. Tech. 24, 435-441, 1993.Sierksma, G. and Hoogeveen, H. "Seven Criteria for Integer Sequences Being Graphic." J. Graph Th. 15, 223-231, 1991.Slater, P. J. "Note on -Graceful, Locally Finite Graphs." J. Combin. Th. Ser. B 35, 319-322, 1983.Sloane, N. J. A. Sequences A308544, A308545, A308548, A308549, A308556, A308557, and A308722 in "The On-Line Encyclopedia of Integer Sequences."Snevily, H. S. "New Families of Graphs That Have -Labellings." Preprint.Snevily, H. S. "Remarks on the Graceful Tree Conjecture." Preprint.Truszczyński, M. "Graceful Unicyclic Graphs." Demonstatio Math. 17, 377-387, 1984.Xie, L. T. and Liu, G. Z. "A Survey of the Problem of Graceful Trees." Qufu Shiyuan Xuebao 1, 8-15, 1984.

Referenced on Wolfram|Alpha

Graceful Graph

Cite this as:

Weisstein, Eric W. "Graceful Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GracefulGraph.html

Subject classifications