请输入您要查询的百科知识：

　

词条 Graceful labeling
释义

  1. Selected results

  2. See also

  3. External links

  4. References

  5. Further reading

{{unsolved|mathematics|Are all trees graceful?}}

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference between its endpoints, such that this magnitude lies between 1 and m inclusive.[1] A graph which admits a graceful labeling is called a graceful graph.

The name "graceful labeling" is due to Solomon W. Golomb; this class of labelings was originally given the name β-labelings by Alexander Rosa in a 1967 paper on graph labelings.[2]

A major unproven conjecture in graph theory is the Graceful Tree conjecture or Ringel–Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, which hypothesizes that all trees are graceful. The Ringel–Kotzig conjecture is also known as the "graceful labeling conjecture". Kotzig once called the effort to prove the conjecture a "disease".[3]

Another weaker version of graceful labelling is the near graceful labeling, in which the vertices can be labeled using some subset of the integers between 0 and m+1 inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference between its endpoints, such that this magnitude lies between 1 and m+1 inclusive.

Another conjecture in graph theory is the Rosa's Conjecture, named after Alexander Rosa, which says that all triangular cacti are graceful or nearly-graceful.[4]

Selected results

  • In his original paper, Rosa proved that an Eulerian graph with number of edges m ≡ 1 (mod 4) or m ≡ 2 (mod 4) cannot be graceful.[2]
  • Also in his original paper, Rosa proved that the cycle Cn is graceful if and only if n ≡ 0 (mod 4) or n ≡ 3 (mod 4).
  • All path graphs and caterpillar graphs are graceful.
  • All lobster graphs with a perfect matching are graceful.[5]
  • All trees with at most 27 vertices are graceful; this result was shown by Aldred and McKay in 1998 using a computer program.[6][7] This was extended to trees with at most 29 vertices in the Honours thesis of Michael Horton.[8] Another extension of this result up to trees with 35 vertices was claimed in 2010 by the Graceful Tree Verification Project, a distributed computing project led by Wenjie Fang.[9]
  • All wheel graphs, web graphs, helm graphs, gear graphs, and rectangular grids are graceful.[6]
  • All n-dimensional hypercubes are graceful.[10]
  • All simple graphs with four or fewer vertices are graceful. The only non-graceful simple graphs with five vertices are the 5-cycle (pentagon); the complete graph K5; and the butterfly graph.[11]

See also

  • Edge-graceful labeling
  • List of conjectures

External links

  • [https://www.youtube.com/watch?v=v5KWzOOhZrw Numberphile video about graceful tree conjecture]

References

1. ^Virginia Vassilevska, "Coding and Graceful Labeling of trees." SURF 2001. PostScript
2. ^1 {{citation | last = Rosa | first = A. | contribution = On certain valuations of the vertices of a graph | location = New York | mr = 0223271 | pages = 349–355 | publisher = Gordon and Breach | title = Theory of Graphs (Internat. Sympos., Rome, 1966) | year = 1967}}.
3. ^{{citation | last1 = Huang | first1 = C. | last2 = Kotzig | first2 = A. | author2-link = Anton Kotzig | last3 = Rosa | first3 = A. | journal = Utilitas Mathematica | mr = 668845 | pages = 31–48 | title = Further results on tree labellings | volume = 21 | year = 1982}}.
4. ^{{citation|last=Rosa|first=A.|title=Cyclic Steiner Triple Systems and Labelings of Triangular Cacti|journal=Scientia|volume=1|pages=87--95|year=1988}}.
5. ^{{citation | last = Morgan | first = David | journal = Bulletin of the Institute of Combinatorics and its Applications | pages = 82–85 | title = All lobsters with perfect matchings are graceful | url = http://hdl.handle.net/10402/era.26923 | volume = 53 | year = 2008}}.
6. ^1 {{citation | last = Gallian | first = Joseph A. | author-link = Joseph Gallian | journal = Electronic Journal of Combinatorics | mr = 1668059 | page = Dynamic Survey 6, 43 pp. (389 pp. in 18th ed.) (electronic) | title = A dynamic survey of graph labeling | url = http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/DS6/pdf | volume = 5 | year = 1998}}.
7. ^{{citation | last1 = Aldred | first1 = R. E. L. | last2 = McKay | first2 = Brendan D. | author2-link = Brendan McKay | journal = Bulletin of the Institute of Combinatorics and its Applications | mr = 1621760 | pages = 69–72 | title = Graceful and harmonious labellings of trees | volume = 23 | year = 1998}}.
8. ^{{citation | last = Horton | first = Michael P. | author-link = Michael P. Horton | title = Graceful Trees: Statistics and Algorithms | url = http://eprints.utas.edu.au/19/ | year = 2003}}.
9. ^{{citation | last = Fang | first = Wenjie | arxiv = 1003.3045| title = A Computational Approach to the Graceful Tree Conjecture | year = 2010| bibcode = 2010arXiv1003.3045F}}. See also [https://web.archive.org/web/20120729224449/http://www.eleves.ens.fr/home/wfang/gtv/index_en.html Graceful Tree Verification Project]
10. ^{{citation | last = Kotzig | first = Anton | author-link = Anton Kotzig | doi = 10.1016/0095-8956(81)90031-9 | issue = 3 | journal = Journal of Combinatorial Theory, Series B | mr = 638285 | pages = 292–296 | title = Decompositions of complete graphs into isomorphic cubes | volume = 31 | year = 1981}}.
11. ^{{mathworld|title=Graceful graph|urlname=GracefulGraph}}

Further reading

  • (K. Eshghi) Introduction to Graceful Graphs, Sharif University of Technology, 2002.
  • (U. N. Deshmukh and Vasanti N. Bhat-Nayak), New families of graceful banana trees – Proceedings Mathematical Sciences, 1996 – Springer
  • (M. Haviar, M. Ivaska), Vertex Labellings of Simple Graphs, Research and Exposition in Mathematics, Volume 34, 2015.
  • (Ping Zhang), A Kaleidoscopic View of Graph Colorings, SpringerBriefs in Mathematics, 2016 – Springer

2 : Graph theory objects|Conjectures
随便看

　

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

　

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间：2024/9/20 9:40:24