可迹图的一些新充分条件  

Some new sufficient condition on traceable graphs

作　　者：余桂东 刘珍珍 王礼想 李青 YU Guidong;LIU Zhenzhen;WANG Lixiang;LI Qing(School of Mathematics and Physics,AnqingNormal University,Anqing 246133,Anhui,China;DepartmentofPublic Teanching,Hefei Preschool Education College,Hefei 230013,Anhui,China)

机构地区：[1]安庆师范大学数理学院,安徽安庆246133 [2]合肥幼儿师范高等专科学校公共教学部,安徽合肥230013

出　　处：《运筹学学报（中英文）》2024年第1期131-140,共10页Operations Research Transactions

基　　金：国家自然科学基金(No.11671164);安徽省自然科学基金(No.1808085MA04);安徽省高校自然科学基金(Nos.KJ2020A0894,KJ2021A0650);安徽高校研究生科学研项目(No.YJS20210515);合肥幼儿师范高等专科学校科研创新团队(No.KCTD202001)。

摘　　要：设图G是一个简单连通图,e(G)、μ(G)和q(G)分别为图G的边数、谱半径和无符号拉普拉斯谱半径。如果一个图含有一条包含所有顶点的路,则这条路为哈密尔顿路,称这个图为可迹图。本文主要研究利用e(G)、μ(G)和q(G)分别给出图G是可迹图的一些新充分条件,所得结果推广了已有的结论。Let G be a simple connected graph,e(G),μ(G)and q(G)be the edge number,the spectral radius and the signless Laplacian spectral radius of the graph G,respectively.If a graph has a path which contains all vertices of the graph,the path is called a Hamilton path,the graph is called traceable graph.In this paper,we present some new suficient conditions for the graph to be traceable graph in terms of e(G),μ(G)and q(G),respectively.The results generalize the existing conclusions.

关 键 词：图 可迹图 边数 谱半径 无符号拉普拉斯谱半径 

分 类 号：O157.5[理学—数学]