基于萨格勒布指数差的图的哈密顿特性的充分条件

Yuxin Jin, Shuming Zhou, Tao Tian, Kinkar Chandra Das
{"title":"基于萨格勒布指数差的图的哈密顿特性的充分条件","authors":"Yuxin Jin, Shuming Zhou, Tao Tian, Kinkar Chandra Das","doi":"10.1007/s40314-024-02909-x","DOIUrl":null,"url":null,"abstract":"<p>A graph invariant, in the sense of graph automorphism, is a mapping from the set of graphs to the reals. Numerous topological indices have been proposed to characterize the topological properties of graphs, and they are widely recognized as graph invariants. Some sufficient conditions in terms of certain topological indices have been suggested to describe hamiltonian properties of graphs, such as Hamiltonicity, traceability, Hamiltonian-connectedness, <i>k</i>-leaf-connectedness, as well as <span>\\(\\beta \\)</span>-deficiency. For a graph <i>G</i>, the first and second Zagreb indices are defined as <span>\\(M_1(G)= \\sum \\nolimits _{u\\in V(G)} {d_u^2}\\)</span> and <span>\\(M_2(G)= \\sum \\nolimits _{uv\\in E(G)} {d_u}{d_v}\\)</span>, where <span>\\(d_u\\)</span> denotes the degree of vertex <i>u</i> in <i>G</i>. The difference of Zagreb indices of <i>G</i> is defined as <span>\\(\\Delta M(G) = {M_2}(G) - {M_1}(G)\\)</span>. In this paper, we suggest some sufficient conditions in terms of <span>\\(\\Delta M(G)\\)</span> for graphs to be Hamiltonian, Hamiltonian-connected and <span>\\(\\beta \\)</span>-deficient, respectively.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"53 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sufficient conditions for hamiltonian properties of graphs based on the difference of Zagreb indices\",\"authors\":\"Yuxin Jin, Shuming Zhou, Tao Tian, Kinkar Chandra Das\",\"doi\":\"10.1007/s40314-024-02909-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A graph invariant, in the sense of graph automorphism, is a mapping from the set of graphs to the reals. Numerous topological indices have been proposed to characterize the topological properties of graphs, and they are widely recognized as graph invariants. Some sufficient conditions in terms of certain topological indices have been suggested to describe hamiltonian properties of graphs, such as Hamiltonicity, traceability, Hamiltonian-connectedness, <i>k</i>-leaf-connectedness, as well as <span>\\\\(\\\\beta \\\\)</span>-deficiency. For a graph <i>G</i>, the first and second Zagreb indices are defined as <span>\\\\(M_1(G)= \\\\sum \\\\nolimits _{u\\\\in V(G)} {d_u^2}\\\\)</span> and <span>\\\\(M_2(G)= \\\\sum \\\\nolimits _{uv\\\\in E(G)} {d_u}{d_v}\\\\)</span>, where <span>\\\\(d_u\\\\)</span> denotes the degree of vertex <i>u</i> in <i>G</i>. The difference of Zagreb indices of <i>G</i> is defined as <span>\\\\(\\\\Delta M(G) = {M_2}(G) - {M_1}(G)\\\\)</span>. In this paper, we suggest some sufficient conditions in terms of <span>\\\\(\\\\Delta M(G)\\\\)</span> for graphs to be Hamiltonian, Hamiltonian-connected and <span>\\\\(\\\\beta \\\\)</span>-deficient, respectively.</p>\",\"PeriodicalId\":51278,\"journal\":{\"name\":\"Computational and Applied Mathematics\",\"volume\":\"53 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s40314-024-02909-x\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s40314-024-02909-x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图不变式是指从图集到实数的映射。人们提出了许多拓扑指数来描述图的拓扑性质,它们被广泛认为是图不变式。某些拓扑指数被认为是描述图的哈密顿性质的充分条件,如哈密顿性(Hamiltonicity)、可追溯性(traceability)、哈密顿连接性(Hamiltonian-connectedness)、k-叶连接性(k-leaf-connectedness)以及(\beta \)缺失性(deficiency)。对于一个图 G,第一个和第二个萨格勒布指数定义为 \(M_1(G)= \sum \nolimits _{u\in V(G)} {d_u^2}\) 和 \(M_2(G)= \sum \nolimits _{uv\in E(G)} {d_u}{d_v}\) ,其中 \(d_u\) 表示 G 中顶点 u 的度数。G 的萨格勒布指数差定义为 \(\Delta M(G) = {M_2}(G) - {M_1}(G)\)。在本文中,我们提出了一些关于 \(\Delta M(G)\) 的充分条件,这些条件分别适用于哈密尔顿图、哈密尔顿连接图和( \beta \)缺陷图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Sufficient conditions for hamiltonian properties of graphs based on the difference of Zagreb indices

A graph invariant, in the sense of graph automorphism, is a mapping from the set of graphs to the reals. Numerous topological indices have been proposed to characterize the topological properties of graphs, and they are widely recognized as graph invariants. Some sufficient conditions in terms of certain topological indices have been suggested to describe hamiltonian properties of graphs, such as Hamiltonicity, traceability, Hamiltonian-connectedness, k-leaf-connectedness, as well as \(\beta \)-deficiency. For a graph G, the first and second Zagreb indices are defined as \(M_1(G)= \sum \nolimits _{u\in V(G)} {d_u^2}\) and \(M_2(G)= \sum \nolimits _{uv\in E(G)} {d_u}{d_v}\), where \(d_u\) denotes the degree of vertex u in G. The difference of Zagreb indices of G is defined as \(\Delta M(G) = {M_2}(G) - {M_1}(G)\). In this paper, we suggest some sufficient conditions in terms of \(\Delta M(G)\) for graphs to be Hamiltonian, Hamiltonian-connected and \(\beta \)-deficient, respectively.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
11.50%
发文量
352
期刊介绍: Computational & Applied Mathematics began to be published in 1981. This journal was conceived as the main scientific publication of SBMAC (Brazilian Society of Computational and Applied Mathematics). The objective of the journal is the publication of original research in Applied and Computational Mathematics, with interfaces in Physics, Engineering, Chemistry, Biology, Operations Research, Statistics, Social Sciences and Economy. The journal has the usual quality standards of scientific international journals and we aim high level of contributions in terms of originality, depth and relevance.
期刊最新文献
Two efficient nonlinear conjugate gradient methods for Riemannian manifolds A new algorithm for approximating solutions of the common variational inclusion On some extension of Traub–Steffensen type methods in Banach spaces Neighbourhood and competition graphs under fuzzy incidence graph and its application Chebyshev polynomial derivative-based spectral tau approach for solving high-order differential equations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1