Extremal Kirchho index in polycyclic chains Hechao Liu Lihua You School of Mathematical Sciences South China Normal University Guangzhou 510631
2025-04-27
0
0
1.65MB
15 页
10玖币
侵权投诉
Extremal Kirchhoff index in polycyclic chains
Hechao Liu, Lihua You∗
School of Mathematical Sciences, South China Normal University, Guangzhou, 510631,
P. R. China, e-mail: hechaoliu@m.scnu.edu.cn,ylhua@scnu.edu.cn
∗Corresponding author
Received 12 October 2022
Abstract The Kirchhoff index of graphs, introduced by Klein and Randi´c in 1993,
has been known useful in the study of computer science, complex network and quantum
chemistry. The Kirchhoff index of a graph Gis defined as Kf(G) = P
{u,v}⊆V(G)
ΩG(u, v),
where ΩG(u, v) denotes the resistance distance between uand vin G.
In this paper, we determine the maximum (resp. minimum) k-polycyclic chains with
respect to Kirchhoff index for k≥5, which extends the results of Yang and Klein [Com-
parison theorems on resistance distances and Kirchhoff indices of S, T -isomers, Discrete
Appl. Math. 175 (2014) 87-93], Yang and Sun [Minimal hexagonal chains with respect
to the Kirchhoff index, Discrete Math. 345 (2022) 113099], Sun and Yang [Extremal
pentagonal chains with respect to the Kirchhoff index, Appl. Math. Comput. 437 (2023)
127534] and Ma [Extremal octagonal chains with respect to the Kirchhoff index, arXiv:
2209.10264].
Keywords Kirchhoff index, resistance distance, polycyclic chain.
Mathematics Subject Classification: 05C09, 05C12, 05C92
1 Introduction
1.1 Background
Let Gbe a connected graph with vertex set V(G) and edge set E(G). Let dG(u) be
the degree of vertex uin G. The distance between vertex uand vertex vis denoted by
dG(u, v). If we replace each edge of the graph Gwith a unit resistor and regard the graph
Gas an electrical network N, then we define the effective resistance of vertex uand vertex
vin the electrical network Nas the resistance distance between vertex uand vertex v
in the graph G, and denoted by ΩG(u, v). In this paper, all notations and terminologies
used but not defined can refer to Bondy and Murty [1].
The Wiener index is one of the oldest and most studied topological index from ap-
1
arXiv:2210.02080v2 [math.CO] 12 Oct 2022
plication and theoretical viewpoints. As a extension of the Wiener index, The Kirchhoff
index is an important measure which contains more information than the Wiener index
and plays an essential role in the research of QSAR and QSPR.
The Wiener index [24] of graph Gis defined as W(G) = P
{u,v}⊆V(G)
dG(u, v), replacing
distance with resistance distance in the definition of Wiener index, we can obtain the
Kirchhoff index, which is defined as [13]
Kf(G) = X
{u,v}⊆V(G)
ΩG(u, v).
Some mathematical and physical interpretations of Kirchhoff index can be found in [12,14].
The extremal Kirchhoff index had been considered on unicyclic graphs [26], fully loaded
unicyclic graphs [8], cacti [25], graphs with given cut edges [7], graphs with a given vertex
bipartiteness [16], random polyphenyl and spiro chains [9], linear hexagonal (cylinder)
chain [10], generalized phenylenes [15, 32], M¨obius/cylinder octagonal chain [17], linear
phenylenes [19], connected (molecular) graphs [33], and so on.
Some molecular descriptors of polycyclic chains had been considered for many years.
Such as Wiener index [3,5], Kirchhoff index [18,22,27–30], Tutte polynomials [2], Merrified-
Simmons index [4], Kekule structures [23], forcing spectrum [31], k-matching [6], Hosoya
index [21], and so on.
Let Qhbe the linear quadrilateral chain with hsquares and Si(1 ≤i≤h) the i-th
square of Qh. Then the k-polycyclic chain Phcan be obtained from Qhby adding k−4
vertices to Si(1 ≤i≤h) by adding 0 (resp. 1,2,· · · , k −4) vertices to the top edge of Si
(1 ≤i≤h) and the remaining vertices to the bottom edge of Si(1 ≤i≤h). In Figure
1, either D5or L5is a special P5,Z6is a special P6.
For convenience, we suppose that we add dk−4
2evertices to the top edges of S1and
Sh,bk−4
2cvertices to the bottom edges of S1and Sh, and for the Si+1 (1 ≤i≤h−2),
we give a number wi= 0 (resp. 1,2,· · · , k −4) to the k-polygon if the k-polygon is
obtained by adding wivertices to the top edge of Si+1. Then we can use a (h−2)-
vector w= (w1, w2,· · · , wh−2) to denote the k-polycyclic chain, where wi∈ {0,1,· · · , k −
4}. Let Ph(w) (or simply P(w)) be the k-polycyclic chain with h k-polygons and w=
(w1, w2,· · · , wh−2)bea(h−2)-tuple of 0,1,· · · , k −4.
The k-polycyclic chain P(0,0,· · · ,0
| {z }
h−2
) or P(k−4, k −4,· · · , k −4
| {z }
h−2
) is called a helicene
k-polycyclic chain, where P(0,0,· · · ,0
| {z }
h−2
)∼
=P(k−4, k −4,· · · , k −4
| {z }
h−2
), and denoted by
2
Dh. If k≥6 is even, the k-polycyclic chain P(k−4
2,k−4
2,· · · ,k−4
2
| {z }
h−2
) is called a lin-
ear k-polycyclic chain, and denoted by Lh. If k≥5 is odd, then k-polycyclic chain
P(bk−4
2c,dk−4
2e,bk−4
2c,dk−4
2e · · ·
| {z }
h−2
) or P(dk−4
2e,bk−4
2c,dk−4
2e,bk−4
2c · · ·
| {z }
h−2
) is
called a zigzag chain, denoted by Zh, where P(bk−4
2c,dk−4
2e,bk−4
2c,dk−4
2e · · ·
| {z }
h−2
)∼
=
P(dk−4
2e,bk−4
2c,dk−4
2e,bk−4
2c · · ·
| {z }
h−2
). Figure 1 gives D5with k= 6, L5with k= 6
and Z6with k= 7.
Figure 1: D5with k= 6, L5with k= 6 and Z6with k= 7.
1.2 Main results
Our main results are shown as follows.
Theorem 1.1 Let Phbe the set of k-polycyclic chains with h k-polygons (k≥5). Then
for any G∈ Ph, we have
Kf(G)≥Kf(P(0,0,· · · ,0
| {z }
h−2
)),
with equality if and only if G∼
=Dh.
Theorem 1.2 Let Phbe the set of k-polycyclic chains with h k-polygons (k≥5). Then
for any G∈ Ph, we have
Kf(G)≤Kf(P(bk−4
2c,dk−4
2e,bk−4
2c,dk−4
2e,· · ·
| {z }
h−2
)),
3
摘要:
展开>>
收起<<
ExtremalKirchhoindexinpolycyclicchainsHechaoLiu,LihuaYouSchoolofMathematicalSciences,SouthChinaNormalUniversity,Guangzhou,510631,P.R.China,e-mail:hechaoliu@m.scnu.edu.cn,ylhua@scnu.edu.cnCorrespondingauthorReceived12October2022AbstractTheKirchhoindexofgraphs,introducedbyKleinandRandicin1993,has...
声明:本站为文档C2C交易模式,即用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。玖贝云文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知玖贝云文库,我们立即给予删除!
相关推荐
-
公司营销部领导述职述廉报告VIP免费
2024-12-03 4 -
100套述职述廉述法述学框架提纲VIP免费
2024-12-03 3 -
20220106政府党组班子党史学习教育专题民主生活会“五个带头”对照检查材料VIP免费
2024-12-03 3 -
20220106县纪委监委领导班子党史学习教育专题民主生活会对照检查材料VIP免费
2024-12-03 6 -
A文秘笔杆子工作资料汇编手册(近70000字)VIP免费
2024-12-03 3 -
20220106县领导班子党史学习教育专题民主生活会对照检查材料VIP免费
2024-12-03 4 -
经济开发区党工委书记管委会主任述学述职述廉述法报告VIP免费
2024-12-03 34 -
20220106政府领导专题民主生活会五个方面对照检查材料VIP免费
2024-12-03 11 -
派出所教导员述职述廉报告6篇VIP免费
2024-12-03 8 -
民主生活会对县委班子及其成员批评意见清单VIP免费
2024-12-03 50
分类:图书资源
价格:10玖币
属性:15 页
大小:1.65MB
格式:PDF
时间:2025-04-27


渝公网安备50010702506394