Maximal polyomino chains with respect to the Kirchhoff index

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
Wensheng Sun , Yujun Yang , Shou-Jun Xu
{"title":"Maximal polyomino chains with respect to the Kirchhoff index","authors":"Wensheng Sun ,&nbsp;Yujun Yang ,&nbsp;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}
引用次数: 0

Abstract

Let G be a connected graph. The resistance distance between two vertices u and v of G is defined as the potential difference generated between u and v induced by the unique uv flow when a unit current flows in from node u and flows out from node v. The Kirchhoff index of G is defined as the sum of all the resistance distances pairs of G. 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 S,T-isomers, we first show that among all polyomino chains with n 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.
关于Kirchhoff指数的极大多亚链
设G是连通图。G的两个顶点u和v之间的电阻距离定义为当一个单位电流从节点u流入和从节点v流出时,由唯一的u→v流引起的u和v之间产生的电位差。G的Kirchhoff指数定义为G的所有电阻距离对的总和。多聚链作为一种重要的几何结构,在统计物理和数学化学中得到了广泛的研究。本文采用电网络的标准技术,利用S, t异构体的Kirchhoff指数的比较结果,首先证明了在所有n平方的多聚体链中,只有当多聚体链是“无弯曲”链时,Kirchhoff指数才会达到最大值。此外,根据阻力距离的递推公式,对Kirchhoff指数最大和最小的“无弯曲”链进行了表征。得到了具有最大Kirchhoff指数的多聚链。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信