Mycielski图的哈密尔顿连通性  

Hamilton-Connectedness of Mycielski Graphs

作　　者：沈源源 

机构地区：[1]陕西职业技术学院基础课部,陕西 西安

出　　处：《理论数学》2024年第3期83-88,共6页Pure Mathematics

摘　　要：2017年,Jarnicki等人提出如下猜想:如果图G是哈密尔顿连通的且不是K2,那么它的Mycielski图也是哈密尔顿连通的。在这篇论文中,证明了该猜想在部分图上是正确的。本文的主要研究结果如下:刻画了特殊图类的Mycielski图是哈密尔顿连通的。当图G满足最小度时,是哈密尔顿连通的。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图 哈密尔顿连通 Mycielski因子 

分 类 号：O15[理学—数学]