{"title":"关于Kirchhoff指数的极大多亚链","authors":"Wensheng Sun , Yujun Yang , Shou-Jun Xu","doi":"10.1016/j.dam.2025.08.060","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><mi>G</mi></math></span> be a connected graph. The resistance distance between two vertices <span><math><mi>u</mi></math></span> and <span><math><mi>v</mi></math></span> of <span><math><mi>G</mi></math></span> is defined as the potential difference generated between <span><math><mi>u</mi></math></span> and <span><math><mi>v</mi></math></span> induced by the unique <span><math><mrow><mi>u</mi><mo>→</mo><mi>v</mi></mrow></math></span> flow when a unit current flows in from node <span><math><mi>u</mi></math></span> and flows out from node <span><math><mi>v</mi></math></span>. The Kirchhoff index of <span><math><mi>G</mi></math></span> is defined as the sum of all the resistance distances pairs of <span><math><mi>G</mi></math></span>. Polyomino chains, as an important geometric structure, have been widely studied in statistical physics and mathematical chemistry. In this paper, by employing standard techniques from electrical networks and using comparison results on the Kirchhoff index of <span><math><mrow><mi>S</mi><mo>,</mo><mi>T</mi></mrow></math></span>-isomers, we first show that among all polyomino chains with <span><math><mi>n</mi></math></span> squares, the maximum Kirchhoff index is attained only when the polyomino chain is a “bend-free” chain. Furthermore, according to the recursion formula for the resistance distances, “bend-free” chains with maximum and minimum Kirchhoff index are characterized. As a result, the polyomino chains with maximum Kirchhoff index are obtained.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"380 ","pages":"Pages 34-50"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximal polyomino chains with respect to the Kirchhoff index\",\"authors\":\"Wensheng Sun , Yujun Yang , Shou-Jun Xu\",\"doi\":\"10.1016/j.dam.2025.08.060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Let <span><math><mi>G</mi></math></span> be a connected graph. The resistance distance between two vertices <span><math><mi>u</mi></math></span> and <span><math><mi>v</mi></math></span> of <span><math><mi>G</mi></math></span> is defined as the potential difference generated between <span><math><mi>u</mi></math></span> and <span><math><mi>v</mi></math></span> induced by the unique <span><math><mrow><mi>u</mi><mo>→</mo><mi>v</mi></mrow></math></span> flow when a unit current flows in from node <span><math><mi>u</mi></math></span> and flows out from node <span><math><mi>v</mi></math></span>. The Kirchhoff index of <span><math><mi>G</mi></math></span> is defined as the sum of all the resistance distances pairs of <span><math><mi>G</mi></math></span>. Polyomino chains, as an important geometric structure, have been widely studied in statistical physics and mathematical chemistry. In this paper, by employing standard techniques from electrical networks and using comparison results on the Kirchhoff index of <span><math><mrow><mi>S</mi><mo>,</mo><mi>T</mi></mrow></math></span>-isomers, we first show that among all polyomino chains with <span><math><mi>n</mi></math></span> squares, the maximum Kirchhoff index is attained only when the polyomino chain is a “bend-free” chain. Furthermore, according to the recursion formula for the resistance distances, “bend-free” chains with maximum and minimum Kirchhoff index are characterized. As a result, the polyomino chains with maximum Kirchhoff index are obtained.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"380 \",\"pages\":\"Pages 34-50\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-09-12\",\"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/S0166218X25005190\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25005190","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Maximal polyomino chains with respect to the Kirchhoff index
Let be a connected graph. The resistance distance between two vertices and of is defined as the potential difference generated between and induced by the unique flow when a unit current flows in from node and flows out from node . The Kirchhoff index of is defined as the sum of all the resistance distances pairs of . Polyomino chains, as an important geometric structure, have been widely studied in statistical physics and mathematical chemistry. In this paper, by employing standard techniques from electrical networks and using comparison results on the Kirchhoff index of -isomers, we first show that among all polyomino chains with squares, the maximum Kirchhoff index is attained only when the polyomino chain is a “bend-free” chain. Furthermore, according to the recursion formula for the resistance distances, “bend-free” chains with maximum and minimum Kirchhoff index are characterized. As a result, the polyomino chains with maximum Kirchhoff index are obtained.
期刊介绍:
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.