{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:10Z","timestamp":1781463310275,"version":"3.54.1"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.005","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T10:48:32Z","timestamp":1779101312000},"page":"218-230","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On topological indices, graph compression, and threshold graphs"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0121-4884","authenticated-orcid":false,"given":"Nathan","family":"Kahl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristi","family":"Luttrell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.05.005_b1","first-page":"1","article-title":"On extremal trees with respect to the F-index","volume":"44","author":"Abdo","year":"2017","journal-title":"Kuwait J. Sci."},{"key":"10.1016\/j.dam.2026.05.005_b2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.akcej.2016.11.011","article-title":"Extremal unicyclic and bicyclic graphs with respect to the F-index","volume":"14","author":"Akhtar","year":"2017","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"10.1016\/j.dam.2026.05.005_b3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.dam.2022.10.009","article-title":"On the maximum sigma index of k-cyclic graphs","volume":"325","author":"Ali","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.dam.2017.12.007","article-title":"On the extremal graphs with respect to bond incident degree indices","volume":"238","author":"Ali","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2018.10.009","article-title":"On the extremal graphs for general sum-connectivity index (\u03c7\u03b1) with given cyclomatic number when \u03b1>1","volume":"257","author":"Ali","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.dam.2014.10.037","article-title":"New bounds of degree-based topological indices for some classes of c-cyclic graphs","volume":"184","author":"Bianchi","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b7","doi-asserted-by":"crossref","first-page":"2731","DOI":"10.1016\/j.dam.2013.04.023","article-title":"A majorization method for localizing graph topological indices","volume":"161","author":"Bianchi","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b8","series-title":"Spanning Trees in Undirected Simple Graphs","author":"Bogdanowicz","year":"1985"},{"key":"10.1016\/j.dam.2026.05.005_b9","doi-asserted-by":"crossref","first-page":"3074","DOI":"10.1016\/j.disc.2008.08.010","article-title":"Undirected simple connected graphs with minimum number of spanning trees","volume":"309","author":"Bogdanowicz","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.005_b10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1002\/jgt.21761","article-title":"Chordal 2-connected graphs and spanning trees","volume":"76","author":"Bogdanowicz","year":"2014","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.005_b11","article-title":"Modern graph theory","volume":"vol. 184","author":"Bollob\u00e1s","year":"2002"},{"key":"10.1016\/j.dam.2026.05.005_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230230103","article-title":"Network transformations and bounding network reliability","volume":"23","author":"Brown","year":"1993","journal-title":"Networks"},{"key":"10.1016\/j.dam.2026.05.005_b13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10910-006-9131-8","article-title":"Extremal (n, n + 1)-graphs with respect to zeroth\u2013order general Randi\u0107 index","volume":"42","author":"Chen","year":"2007","journal-title":"J. Math. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.46793\/match.87-1.023C","article-title":"Extremal values on the Sombor index of trees","volume":"87","author":"Chen","year":"2022","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b15","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1007\/s10910-021-01232-8","article-title":"Extremal values of the sombor index in unicyclic and bicyclic graphs","volume":"59","author":"Cruz","year":"2021","journal-title":"J. Math. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b16","doi-asserted-by":"crossref","first-page":"4522","DOI":"10.1016\/j.disc.2009.02.013","article-title":"On a conjecture of V. Nikiforov","volume":"309","author":"Csikv\u00e1ri","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.005_b17","doi-asserted-by":"crossref","first-page":"24","DOI":"10.37236\/669","article-title":"Applications of the Kelmans transformation: extremality of threshold graphs","volume":"18","author":"Csikv\u00e1ri","year":"2011","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.05.005_b18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.20530","article-title":"Extremal graphs for homomorphisms","volume":"67","author":"Cutler","year":"2011","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.005_b19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1002\/jgt.21749","article-title":"Extremal graphs for homomorphisms II","volume":"76","author":"Cutler","year":"2014","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.005_b20","first-page":"10","article-title":"Open problems on Sombor index of unicyclic and bicyclic graphs","volume":"473","author":"Das","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.05.005_b21","first-page":"597","article-title":"A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs","volume":"57","author":"Deng","year":"2007","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b22","first-page":"42","article-title":"On the extremal graphs with respect to the variable sum exdeg index","volume":"1","author":"Dimitrov","year":"2019","journal-title":"Discret. Math. Lett."},{"key":"10.1016\/j.dam.2026.05.005_b23","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1142\/S1793557122501285","article-title":"Reduced Sombor index of bicyclic graphs","volume":"15","author":"Dorjsembe","year":"2022","journal-title":"Asian-Eur. J. Math."},{"key":"10.1016\/j.dam.2026.05.005_b24","first-page":"391","article-title":"Extremal trees with respect to some versions of Zagreb indices via majorization","volume":"8","author":"Eliasi","year":"2017","journal-title":"Iran. J. Math. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b25","doi-asserted-by":"crossref","first-page":"535","DOI":"10.46793\/match.88-3.535G","article-title":"Trees with maximum vertex-degree-based topological indices","volume":"88","author":"Gao","year":"2022","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b26","doi-asserted-by":"crossref","first-page":"699","DOI":"10.46793\/match.89-3.699G","article-title":"Chemical trees with maximal VDB topological indices","volume":"89","author":"Gao","year":"2023","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b27","first-page":"6","article-title":"The extremal trees for exponential vertex-degree-based topological indices","volume":"472","author":"Gao","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.05.005_b28","doi-asserted-by":"crossref","DOI":"10.1155\/2017\/6079450","article-title":"Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs","author":"Gao","year":"2017","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"10.1016\/j.dam.2026.05.005_b29","first-page":"19","article-title":"Extremal graphs with respect to variable sum exdeg index via majorization","volume":"303","author":"Ghalavand","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.05.005_b30","first-page":"369","article-title":"Extremal graphs for the second multiplicative Zagreb index","volume":"8","author":"Ghalavand","year":"2018","journal-title":"Bull. Int. Math. Virtual Inst."},{"key":"10.1016\/j.dam.2026.05.005_b31","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.disc.2009.08.016","article-title":"Graphs with the maximum or minimum number of k-factors","volume":"310","author":"Gross","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.005_b32","first-page":"13","article-title":"Multiplicative Zagreb indices of trees","volume":"1","author":"Gutman","year":"2011","journal-title":"Bull. Int. Math. Virt. Inst."},{"key":"10.1016\/j.dam.2026.05.005_b33","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0602006","article-title":"Threshold sequences","volume":"2","author":"Hammer","year":"1981","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"10.1016\/j.dam.2026.05.005_b34","series-title":"Bounding the irregularity of a graph","first-page":"253","article-title":"Variable neighborhood search for extremal graphs. ix","volume":"vol. 69","author":"Hansen","year":"2005"},{"key":"10.1016\/j.dam.2026.05.005_b35","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1016\/j.dam.2006.11.008","article-title":"Connected (n, m)-graphs with minimum and maximum zeroth\u2013order general Randi\u0107 index","volume":"155","author":"Hu","year":"2007","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b36","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.dam.2018.12.004","article-title":"Graph vulnerability parameters, compression, and quasi-threshold graphs","volume":"259","author":"Kahl","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b37","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.dam.2020.12.025","article-title":"Graph vulnerability parameters, compression, and threshold graphs","volume":"292","author":"Kahl","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b38","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.jctb.2021.09.004","article-title":"Extremal graphs for the Tutte polynomial","volume":"152","author":"Kahl","year":"2022","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.05.005_b39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01904874","article-title":"On graphs with randomly deleted edges","volume":"37","author":"Kelmans","year":"1981","journal-title":"Acta. Math. Acad. Sci. Hung."},{"key":"10.1016\/j.dam.2026.05.005_b40","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s00493-014-3188-y","article-title":"Graphs with the fewest matchings","volume":"36","author":"Keough","year":"2016","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2026.05.005_b41","first-page":"195","article-title":"A unified approach to the extremal trees for different indices","volume":"54","author":"Li","year":"2005","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b42","doi-asserted-by":"crossref","first-page":"25","DOI":"10.3934\/math.2022002","article-title":"The general Albertson irregularity index of graphs","volume":"7","author":"Lin","year":"2021","journal-title":"AIMS Math."},{"key":"10.1016\/j.dam.2026.05.005_b43","article-title":"Threshold graphs and related topics","volume":"vol. 56","author":"Mahadev","year":"1995"},{"key":"10.1016\/j.dam.2026.05.005_b44","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1080\/09728600.2023.2170298","article-title":"Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs","volume":"20","author":"Manian","year":"2023","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"10.1016\/j.dam.2026.05.005_b45","series-title":"Inequalities: Theory of Majorization and Its Applications","author":"Marshall","year":"1979"},{"key":"10.1016\/j.dam.2026.05.005_b46","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.topol.2023.108591","article-title":"Upper and lower bounds for topological indices on unicyclic graphs","volume":"339","author":"Mart\u00ednez-P\u00e9rez","year":"2023","journal-title":"Topology Appl."},{"key":"10.1016\/j.dam.2026.05.005_b47","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0012-365X(96)00274-9","article-title":"Chromatic polynomials with least coefficients","volume":"172","author":"Rodriguez","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.005_b48","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230220206","article-title":"A reliability-improving graph transformation with applications to network reliability","volume":"22","author":"Satyanarayana","year":"1992","journal-title":"Networks"},{"key":"10.1016\/j.dam.2026.05.005_b49","series-title":"Convexity: An Analytic Viewpoint","author":"Simon","year":"2011"},{"key":"10.1016\/j.dam.2026.05.005_b50","first-page":"285","article-title":"Properties of connected (n,m)-graphs extremal relatively to vertex degree function index for convex functions","volume":"85","author":"Tomescu","year":"2021","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b51","doi-asserted-by":"crossref","first-page":"109","DOI":"10.46793\/match.87-1.109T","article-title":"Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions","volume":"87","author":"Tomescu","year":"2022","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b52","first-page":"91","article-title":"Upper and lower bounds of symmetric division deg index","volume":"5","author":"Vasilyev","year":"2014","journal-title":"Iran. J. Math. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b53","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.dam.2015.09.004","article-title":"Some extremal graphs with respect to inverse degree","volume":"203","author":"Xu","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.005_b54","doi-asserted-by":"crossref","first-page":"19126","DOI":"10.3934\/math.20221050","article-title":"Extreme graphs on the Sombor indices","volume":"7","author":"Yang","year":"2022","journal-title":"AIMS Math."},{"key":"10.1016\/j.dam.2026.05.005_b55","first-page":"579","article-title":"Bicyclic graphs with the first three smallest and largest values of the first general Zagreb index","volume":"56","author":"Zhang","year":"2006","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b56","first-page":"427","article-title":"Unicyclic graphs with the first three smallest and largest first general Zagreb index","volume":"55","author":"Zhang","year":"2006","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.05.005_b57","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s12190-015-0898-2","article-title":"On the general sum-connectivity index of tricyclic graphs","volume":"51","author":"Zhu","year":"2016","journal-title":"J. Appl. Math. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002878?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002878?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:34Z","timestamp":1781460514000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":57,"alternative-id":["S0166218X26002878"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.005","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On topological indices, graph compression, and threshold graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}