Spectral conditions of pancyclicity for t-tough graphs

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-04-15 Epub Date: 2025-01-12 DOI:10.1016/j.dam.2025.01.004
Vladimir I. Benediktovich
{"title":"Spectral conditions of pancyclicity for t-tough graphs","authors":"Vladimir I. Benediktovich","doi":"10.1016/j.dam.2025.01.004","DOIUrl":null,"url":null,"abstract":"<div><div>More than 50 years ago Chvátal introduced a new graph invariant, which he called graph toughness. From then on a lot of research has been conducted, mainly related to the relationship between toughness conditions and the existence of cyclic structures, in particular, determining whether the graph is Hamiltonian and pancyclic. A pancyclic graph is certainly Hamiltonian, but not conversely. Bondy in 1973, however, suggested the “metaconjecture”that almost any nontrivial condition on a graph which implies that the graph is Hamiltonian also implies that the graph is pancyclic. We confirm the Bondy’s metaconjecture for <span><math><mi>t</mi></math></span>-tough graphs in the case when <span><math><mrow><mi>t</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>;</mo><mn>2</mn><mo>;</mo><mn>3</mn><mo>}</mo></mrow></mrow></math></span> in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"365 ","pages":"Pages 130-137"},"PeriodicalIF":1.0000,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25000046","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/12 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

More than 50 years ago Chvátal introduced a new graph invariant, which he called graph toughness. From then on a lot of research has been conducted, mainly related to the relationship between toughness conditions and the existence of cyclic structures, in particular, determining whether the graph is Hamiltonian and pancyclic. A pancyclic graph is certainly Hamiltonian, but not conversely. Bondy in 1973, however, suggested the “metaconjecture”that almost any nontrivial condition on a graph which implies that the graph is Hamiltonian also implies that the graph is pancyclic. We confirm the Bondy’s metaconjecture for t-tough graphs in the case when t{1;2;3} in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
t-坚韧图泛环性的谱条件
50多年前Chvátal引入了一个新的图不变量,他称之为图韧性。此后进行了大量的研究,主要涉及到韧性条件与循环结构存在的关系,特别是确定图是否为哈密顿图和全环图。一个泛环图肯定是哈密顿的,但不是相反的。然而,邦迪在1973年提出了一个“元猜想”,即几乎任何图上的非平凡条件都意味着这个图是哈密顿的,也意味着这个图是全环的。在t∈{1;2;3}的情况下,从图的边数、谱半径和无符号拉普拉斯谱半径三个方面证实了t-tough图的Bondy元猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Two kinds of polygonal chains with extremal Kemeny’s constants On the minimum constant resistance curvature conjecture of graphs Tree t-spanners for edge adjacency distances Extremal digraphs containing at most t paths of length 2 with the same endpoints On the (1,1,2,3)-packing coloring of some subcubic graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1