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}
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.
期刊介绍:
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.