Mycielski图的哈密尔顿连通性
Hamilton-Connectedness of Mycielski Graphs
DOI: 10.12677/pm.2024.143087, PDF,   
作者: 沈源源：陕西职业技术学院基础课部，陕西 西安
关键词: Mycielski图；哈密尔顿连通；Mycielski因子；Mycielski Graphs； Hamilton-Connectedness； Mycielski Factor
摘要: 2017年，Jarnicki等人提出如下猜想：如果图G是哈密尔顿连通的且不是K2，那么它的Mycielski图也是哈密尔顿连通的。在这篇论文中，证明了该猜想在部分图上是正确的。本文的主要研究结果如下：刻画了特殊图类的Mycielski图是哈密尔顿连通的。当图G满足最小度时，是哈密尔顿连通的。
Abstract: 2017, Jarnicki and others conjectured that if G is Hamilton-connected and not K2, then its Mycielski graph is Hamilton-connected. In this paper, we confirm that the conjecture is true for part of graphs. Our main results are summarized as follows: We characterize special graph classes of which are depicted to satisfy the characteristics of Hamiltonian connectivity. They are characterized as follows: Graph G satisfies , satisfies Hamiltonian connectivity.
文章引用：沈源源. Mycielski图的哈密尔顿连通性[J]. 理论数学, 2024, 14(3): 83-88. https://doi.org/10.12677/pm.2024.143087

参考文献

[1] Bondy, J.A. and Chvatal, V. (1976) A Method in Graph Theory. Discrete Mathematics, 15, 111-135. [Google Scholar] [CrossRef] 
[2] Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory. Springer, New York. [Google Scholar] [CrossRef] 
[3] Fisher, D.C., Mckenna, P.A. and Boyer, E.D. (1998) Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski’s Graphs. Discrete Applied Mathematics, 84, 93-105. [Google Scholar] [CrossRef] 
[4] Jarnicki, W., Myrvold, W., Saltzman, P. and Wagon, S. (2017) Properties, Proved and Conjectured, of Keller, Mycielski, and Queen Graphs. Ars Mathematica Contemporanea, 13, 427-460. [Google Scholar] [CrossRef] 
[5] Cheng, S.T., Wang, D. and Liu, X. (2018) Hamiltonicity of Mycielski Graphs. American Journal of Applied Mathematics, 6, 20-22. [Google Scholar] [CrossRef] 
[6] Karaganis, J.J. (1968) On the Cube of a Graph. Canadian Mathematical Bulletin, 11, 295-296. [Google Scholar] [CrossRef] 

为你推荐