双正则可二部图的反魔幻标号
Antimagic Labeling of Biregular Cobipartite Graph
DOI: 10.12677/ORF.2023.133200, PDF,    科研立项经费支持
作者: 金靖翔:江苏师范大学数学与统计学院,江苏 徐州
关键词: 图标号反魔幻标号双正则可二部图Graph Labeling Antimagic Labeling Biregular Cobipartite Graph
摘要: 一个简单图G的反魔幻标号是一个双射,使得对于G中任意两点u,v,有 。如果一个图具有反魔幻标号,那么这个图就是反魔幻的。在1990年,Hartsfield和Ringe定义了图的反魔幻标号,并且猜想除K2以外的每一个连通图都是反魔幻的。此猜想自1990年被提出以来受到广泛关注,但仍未完全解决。本文从完全图入手,设计出一种新的标号方式区分了完全图中的各点并且可以得到各点具体的标号和,并且运用这种标号方式将猜想推广到了一类特殊图上——双正则可二部图,证明了每一个双正则可二部图都是反魔幻的。
Abstract: An antimagic labeling of a simple graph G is a bijection  such that  for any two vertices u, v in G. In 1990, Hartsfield and Ringel defined the antimagic labeling of graphs and every connected graph other than K2 is antimagic. This conjecture has received a lot of attention since it was proposed in 1990, but it is still not completely solved. In this paper, we start from complete graphs and devise a new labeling method to distinguish the vertices in complete graphs and obtain the specific sum of the labels of each vertex, and use this labeling method to extend the conjecture to a special class of graphs, the biregular cobipartite graphs, and prove that every biregular cobipartite graph is antimagic.
文章引用:金靖翔. 双正则可二部图的反魔幻标号[J]. 运筹与模糊学, 2023, 13(3): 2008-2017. https://doi.org/10.12677/ORF.2023.133200

参考文献

[1] Hartsfield, N. and Ringel, G. (2003) Pearls in Graph Theory. Dover Publications, Inc., Mineola.
[2] Kaplan, G., Lev, A. and Roditty, Y. (2009) On Zero-Sum Partitions and Anti-Magic Trees. Discrete Mathematics, 309, 2010-2014. [Google Scholar] [CrossRef
[3] Liang, Y.-C., Wong, T.-L. and Zhu, X. (2014) Anti-Magic Labeling of Trees. Discrete Mathematics, 331, 9-14. [Google Scholar] [CrossRef
[4] Chawathe, P.D. and Krishna, V.B. (2002) Antimagic Labeling of Complete m-ary Trees. In: Agarwal, A.K., et al., Eds., Number Theory and Discrete Mathematics, Springer, Berlin, 77-80. [Google Scholar] [CrossRef
[5] Lozano, A., Mora, M., Seara, C. and Tey, J. (2021) Caterpillars Are Antimagic. Mediterranean Journal of Mathematics, 18, Article No. 39. [Google Scholar] [CrossRef
[6] Sethuraman, G. and Shermily, K.M. (2021) Antimagic La-beling of New Classes of Trees. AKCE International Journal of Graphs and Combinatorics, 18, 110-116. [Google Scholar] [CrossRef
[7] Shang, J.-L. (2015) Spiders Are Antimagic. Ars Com-binatoria, 118, 367-372.
[8] Chang, F., Liang, Y.-C., Pan, Z. and Zhu, X. (2016) Antimagic Labeling of Regular Graphs. Journal of Graph Theory, 82, 339-349. [Google Scholar] [CrossRef
[9] Cranston, D.W. (2009) Regular Bipartite Graphs Are Antimagic. Journal of Graph Theory, 60, 173-182. [Google Scholar] [CrossRef
[10] Cranston, D.W., Liang, Y.-C. and Zhu, X. (2015) Regular Graphs of Odd Degree Are Antimagic. Journal of Graph Theory, 80, 28-33. [Google Scholar] [CrossRef
[11] Liang, Y.-C. and Zhu, X. (2014) Antimagic Labeling of Cubic Graphs. Journal of Graph Theory, 75, 31-36. [Google Scholar] [CrossRef
[12] Wang, T.-M. and Zhang, G.-H. (2012) On Antimagic Labeling of Odd Regular Graphs. In: Arumugam, S. and Smyth, W.F., Eds., Combinatorial Algorithms, Springer, Heidelberg, 162-168. [Google Scholar] [CrossRef
[13] Eccles, T. (2016) Graphs of Large Linear Size Are An-timagic. Journal of Graph Theory, 81, 236-261. [Google Scholar] [CrossRef
[14] Li, P.C. (2016) Antimagic Labelings of Cycle Powers. Ars Combinatoria, 124, 341-351.
[15] Vaidya, S.K. and Vyas, N.B. (2013) Annals of Antimagic Labeling of Some Path and Cy-cle-Related Graphs.
[16] Wang, T., Liu, M. and Li, D. (2012) Some Classes of Disconnected Antimagic Graphs and Their Joins. Wuhan University Journal of Natural Sciences, 17, 195-199. [Google Scholar] [CrossRef
[17] Wang, T.-M. and Hsiao, C.-C. (2008) On Anti-Magic Label-ing for Graph Products. Discrete Mathematics, 308, 3624-3633. [Google Scholar] [CrossRef
[18] Yilma, Z.B. (2013) Antimagic Properties of Graphs with Large Maximum Degree. Journal of Graph Theory, 72, 367-373. [Google Scholar] [CrossRef
[19] Chen, G., Saito, A. and Shan, S. (2013) The Existence of a 2-Factor in a Graph Satisfying Thelocal Chvatal-Erdos Condition. SIAM Journal on Discrete Mathematics, 27, 1788-1799. [Google Scholar] [CrossRef