{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T23:08:17Z","timestamp":1775084897977,"version":"3.50.1"},"reference-count":24,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12161094"],"award-info":[{"award-number":["12161094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12071048"],"award-info":[{"award-number":["12071048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12161141006"],"award-info":[{"award-number":["12161141006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12031018"],"award-info":[{"award-number":["12031018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12226303"],"award-info":[{"award-number":["12226303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>The difference of Zagreb indices of a graph G is defined as \u0394M(G)=\u2211u\u2208V(G)(d(u))2\u2212\u2211uv\u2208E(G)d(u)d(v), where d(x) denotes the degree of a vertex x in G. A Halin graph G is a graph that results from a plane tree T without vertices of degree two and with at least one vertex of degree at least three such that all leaves are joined through a cycle C in the embedded order. In this paper, we establish both lower and upper bounds on the difference of Zagreb indices for general Halin graphs and some special Halin graphs with fewer inner vertices. Furthermore, extremal graphs attaining related bounds are found.<\/jats:p>","DOI":"10.3390\/axioms12050450","type":"journal-article","created":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T01:36:38Z","timestamp":1683077798000},"page":"450","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Difference of Zagreb Indices of Halin Graphs"],"prefix":"10.3390","volume":"12","author":[{"given":"Lina","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua 321004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqiao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Management, Beijing University of Chinese Medicine, Beijing 100029, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua 321004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/0009-2614(72)85099-1","article-title":"Graph theory and molecular orbitals. Total \u03c0-electron energy of alternant hydrocarbons","volume":"17","author":"Gutman","year":"1972","journal-title":"Chem. Phys. Lett."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3399","DOI":"10.1063\/1.430994","article-title":"Graph theory and molecular orbitals. XII. Acyclic polyenes","volume":"62","author":"Gutman","year":"1975","journal-title":"J. Phys. Chem."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BFb0111212","article-title":"Topological indices for structure-activity correlations","volume":"114","author":"Balaban","year":"1983","journal-title":"Top. Curr. Chem."},{"key":"ref_4","first-page":"17","article-title":"Bounds for Zagreb indices","volume":"78","author":"Das","year":"2017","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_5","first-page":"1","article-title":"Extremal values on Zagreb indices of trees with given distance k-domination number","volume":"16","author":"Pei","year":"2018","journal-title":"J. Inequal. Appl."},{"key":"ref_6","first-page":"38","article-title":"On a conjecture about the second Zagreb index","volume":"2","author":"Das","year":"2019","journal-title":"Dsicrete Math. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.30538\/psrp-odam2020.0022","article-title":"Second Zagreb indices of transformation graphs and total transformation graphs","volume":"3","author":"Patil","year":"2020","journal-title":"Open J. Discret. Appl. Math."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"127131","DOI":"10.1016\/j.amc.2022.127131","article-title":"Maximum first Zagreb index of orientations of unicyclic graphs with given matching number","volume":"427","author":"Yang","year":"2022","journal-title":"Appl. Math. Comput."},{"key":"ref_9","first-page":"613","article-title":"On vertex degree based molecular structure descriptors","volume":"66","author":"Furtula","year":"2011","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.dam.2014.06.011","article-title":"On difference of Zagreb indices","volume":"178","author":"Furtula","year":"2014","journal-title":"Discret. Appl. Math."},{"key":"ref_11","first-page":"441","article-title":"Comparing Zagreb indices of cyclic graphs","volume":"63","author":"Caporossi","year":"2010","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_12","first-page":"157","article-title":"On the constant difference of Zagreb indices","volume":"68","author":"Stevanovixcx","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.dam.2016.07.008","article-title":"Complete characterization of graphs for direct comparing Zagreb indices","volume":"215","author":"Horoldagva","year":"2016","journal-title":"Discret. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.disc.2015.11.013","article-title":"On the sum of squares of degrees and products of adjacent degrees","volume":"339","author":"Wang","year":"2016","journal-title":"Discret. Math."},{"key":"ref_15","first-page":"337","article-title":"Difference of Zagreb indices and reduced second zagreb index of cyclic graphs with cut edges","volume":"78","author":"Horoldagva","year":"2017","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s10878-019-00391-4","article-title":"On the extremal cacti of given parameters with respect to the difference of zagreb indices","volume":"38","author":"Li","year":"2019","journal-title":"J. Comb. Optim."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"125187","DOI":"10.1016\/j.amc.2020.125187","article-title":"Computation on the difference of Zagreb indices of maximal planar graphs with diameter two","volume":"377","author":"Wang","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/jgt.3190090311","article-title":"Length of cycles in Halin graphs","volume":"8","author":"Bondy","year":"1985","journal-title":"J. Graph Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1002\/jgt.10111","article-title":"Minimum cycle bases of Halin graphs","volume":"43","author":"Stadler","year":"2003","journal-title":"J. Graph Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1536","DOI":"10.1016\/j.disc.2011.09.016","article-title":"The strong chromatic index of Halin graphs","volume":"312","author":"Lai","year":"2012","journal-title":"Discrete Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1137\/070687988","article-title":"Edge-face total chromatic number of Halin graphs","volume":"23","author":"Chan","year":"2009","journal-title":"SIAM J. Discret. Math."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ipl.2006.02.009","article-title":"The 2-dipath chromatic number of Halin graphs","volume":"99","author":"Chen","year":"2006","journal-title":"Inform. Process. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.aml.2008.08.019","article-title":"The strong chromatic index of complete cubic Halin graphs","volume":"22","author":"Shiu","year":"2009","journal-title":"Appl. Math. Lett."},{"key":"ref_24","first-page":"331","article-title":"Distance two labeling of Halin graphs","volume":"114","author":"Wang","year":"2014","journal-title":"Ars Combin."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/5\/450\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:28:11Z","timestamp":1760124491000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/5\/450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":24,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["axioms12050450"],"URL":"https:\/\/doi.org\/10.3390\/axioms12050450","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,2]]}}}