运筹学学报 ›› 2024, Vol. 28 ›› Issue (1): 131-140.doi: 10.15960/j.cnki.issn.1007-6093.2024.01.011

•   • 上一篇    下一篇

可迹图的一些新充分条件

余桂东1,2,*(), 刘珍珍1, 王礼想1, 李青2   

  1. 1. 安庆师范大学数理学院, 安徽安庆 246133
    2. 合肥幼儿师范高等专科学校公共教学部, 安徽合肥 230013
  • 收稿日期:2020-11-20 出版日期:2024-03-15 发布日期:2024-03-15
  • 通讯作者: 余桂东 E-mail:guidongy@163.com
  • 基金资助:
    国家自然科学基金(11671164);安徽省自然科学基金(1808085MA04);安徽省高校自然科学基金(KJ2020A0894);安徽省高校自然科学基金(KJ2021A0650);安徽高校研究生科学研项目(YJS20210515);合肥幼儿师范高等专科学校科研创新团队(KCTD202001)

Some new sufficient condition on traceable graphs

Guidong YU1,2,*(), Zhenzhen LIU1, Lixiang WANG1, Qing LI2   

  1. 1. School of Mathematics and Physics, Anqing Normal University, Anqing 246133, Anhui, China
    2. Department of Public Teanching, Hefei Preschool Education College, Hefei 230013, Anhui, China
  • Received:2020-11-20 Online:2024-03-15 Published:2024-03-15
  • Contact: Guidong YU E-mail:guidongy@163.com

摘要:

设图$G$是一个简单连通图, $e(G)$$\mu(G)$$q(G)$分别为图$G$的边数、谱半径和无符号拉普拉斯谱半径。如果一个图含有一条包含所有顶点的路, 则这条路为哈密尔顿路, 称这个图为可迹图。本文主要研究利用$e(G)$$\mu(G)$$q(G)$分别给出图$G$是可迹图的一些新充分条件, 所得结果推广了已有的结论。

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

Abstract:

Let $G$ be a simple connected graph, $e(G)$, $\mu(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 sufficient conditions for the graph to be traceable graph in terms of $e(G)$, $\mu(G)$ and $q(G)$, respectively. The results generalize the existing conclusions.

Key words: graphs, traceable graph, edge number, spectral radius, signless Laplacian spectral radius

中图分类号: