图运算下的反对称分割指数

李爽 ,  梅银珍

中北大学学报(自然科学版) ›› 2025, Vol. 46 ›› Issue (03) : 405 -410.

PDF (435KB)
中北大学学报(自然科学版) ›› 2025, Vol. 46 ›› Issue (03) : 405 -410. DOI: 10.62756/jnuc.issn.1673-3193.2023.10.0010
应用基础研究

图运算下的反对称分割指数

作者信息 +

The Inverse Symmetric Division Deg Index Under Graph Operation

Author information +
文章历史 +
PDF (444K)

摘要

分子拓扑指数是分子图的拓扑不变量, 常常用来研究化合物结构与性质之间的关系。反对称分割指数是基于顶点度的一种新型分子拓扑指数。本文研究了两个有限简单连通图经过联、 冠积、 笛卡尔积、 字典序积和对称差的运算所得新图的反对称分割指数和其达到这些上界的极图。首先, 根据联、 冠积、 笛卡尔积、 字典序积和对称差运算的定义, 对这五种运算后表达式的边进行分类。然后, 以顶点的最大度和最小度为基准, 通过放缩法, 对各顶点的度进行合理放缩, 找出各类图运算下的反对称分割指数上界的估值不等式。最后, 证明当两图都为正则图时, 所得图运算的反对称分割指数可取得上界。此研究结果可作为一种预测方法, 对图运算下的其它有关顶点度的拓扑指数的研究具有借鉴意义。

Abstract

Molecular topological indices are topological invariants of molecular graphs, and are often used to study the relationship between structures and properties of compounds. The inverse symmetric division deg index is a new type of molecular topological index based on vertex degree. We studied the inverse symmetric division deg indices of new graphs obtained from two finite simple connected graphs by the operations of Join, Corona product, Cartesian product, Lexicographic and Symmetric, and their extremal graphs reaching these upper bounds. Firstly, the edges of the expression after these five operations were classified according to the definitions of Join, Corona product, Cartesian product, Lexicographic and Symmetric operations. Then, using the maximum and minimum degrees of the vertices, the degree of each vertex was rationally deflated by the deflation method to find out the valuation inequality of the upper bound of the inverse symmetric division deg indices under each type of graph operation. Finally, it was proved that the upper bound of the inverse symmetric division deg index of the resulting graph operations could be obtained when both graphs were regular graphs. The results of this study can be used as a prediction method for other studies on topological indices of vertex degree under graph operations.

Graphical abstract

关键词

图运算 / 反对称分割指数 / 极图 /

Key words

graph operation / inverse symmetric division deg index / extremal graph / bound

引用本文

引用格式 ▾
李爽,梅银珍. 图运算下的反对称分割指数[J]. 中北大学学报(自然科学版), 2025, 46(03): 405-410 DOI:10.62756/jnuc.issn.1673-3193.2023.10.0010

登录浏览全文

4963

注册一个新账户 忘记密码

0 引 言

设图G=VG,EG为无向简单连通图, 其中, 顶点集为VG, 边集为 EG。图G中与顶点v相关联的边的个数称为顶点v的度, 记作dGv, 图G的最大度记为Δ, 最小度记为δ, 对于其他未定义的术语和概念可参阅文献[1]。

2010年, Vukičević2首次提出了图G的对称分割指数(SDD指数)上下界的相关问题。对称分割指数界值相关研究成果可查阅文献[35]。在此基础上, Ghorbani等6在2021年提出了一种新的拓扑指数——图G的反对称分割指数(ISDD指数), 其定义为ISDDG=uvEGdGudGvdG2u+dG2v, 并探讨了对称分割指数和反对称分割指数的一些上下界, 给出了二者之间不等式的关系。随后, Albalahi等7刻画了具有最大和最小反对称分割指数的单圈图。

随着图论的发展, 图运算可将所提供的化学图合成一个新的图, 各种拓扑指数的图运算变成了一个研究热点, 并在化学、 生物学、 网络科学等领域广泛应用。De、 Pattabiraman、 Imran等810分别讨论了F指数、 逆和度指数和Mostar指数的图运算, 并给出了上下界。其它相关结论和应用, 可查阅文献[11-12]。

反对称分割指数作为新提出的拓扑指数, 还有很大的发展空间。本文使用冠积G1G2、 笛卡尔积G1×G2、 字典序积G1G2等图运算, 给出两个反对称分割指数运算后新图的上界, 并刻画了相应的极图。研究图运算下的反对称分割指数有助于理解和应用图的结构性质, 对图运算下的其它有关顶点度的拓扑指数研究具有一定的参考价值。

1 预备知识

定义 113 Gutman等定义了第一和第二Zagreb指数, 分别为M1G=uvE(G)dGu+dGvM2G=uvEGdGudGv

定义 214 设图G1G2具有不相交顶点集VG1VG2。定义顶点集为VG1VG2, 边集为EG1EG2uvuVG1vVG2的图, 即将一个图的每个顶点连接到另一个图的每个顶点, 同时保留两个图原来的所有边, 所得图称为G1G2的联, 记为G1+G2

定义 315 设图G1G2具有不相交顶点集VG1VG2。定义图G1G2的冠积是通过复制VG1G2, 然后将G1中顶点vi和第i个复制的G2的每一个点连接所得的图集, 记为G1G2。其中, VG1G2=n11+n2EG1G2=m1+n1n2+m2

定义 416 设图G1G2具有不相交顶点集VG1VG2和不相交边集EG1EG2。定义图G1G2的笛卡尔积为顶点集为VG1×G2=VG1×VG2, 边集为EG1×G2=ui,vjuk,vlui=uk,vjvlEG2vj=vluiukE(G1)的图, 记为G1×G2

定义 514 设图G1G2具有不相交顶点集VG1VG2和不相交边集EG1EG2。定义图G1和图G2的字典序积为顶点集为VG1G2=VG1×VG2, 边集为EG1G2=ui,vjuk,vluiukEG1ui=uk,vjvlEG2的图, 记为G1G2

定义 617 设图G1G2具有不相交顶点集VG1VG2和不相交边集EG1EG2。定义图G1和图G2的对称差为顶点集为VG1G2=VG1×VG2, 边集为EG1G2=ui,vjuk,vluiukEG1vjvlE(G2), 但两者不能同时存在}的图, 记为G1G2

2 主要结果

定理 1 设图G1G2是简单连通图, 有VG1=n1VG2=n2EG1=m1EG2=m2, 其最大度分别为Δ1Δ2, 最小度分别为δ1δ2, 那么

ISDDG1+G2
m1Δ1+n222δ1+n22+m2Δ2+n122δ2+n12+
n1n2Δ1+n2Δ2+n1δ12+δ22+n12+n22+2δ1n2+2δ2n1

等号成立当且仅当G1G2都是正则图。

证明VG1=u1,u2,,un1VG2=v1,v2,,vn2。由两个图的联定义, 得

dG1+G2u=dG1u+VG2,uVG1,dG2u+VG1,uVG2,

其中, uV(G1+G2)

ISDDG1+G2=
uvEG1+G2dG1+G2udG1+G2vdG1+G22u+dG1+G22v=
uvEG1dG1u+n2dG1v+n2dG1u+n22+dG1v+n22+
uvEG2dG2u+n1dG2v+n1dG2u+n12+dG2v+n12+
uVG1,vVG2dG1u+n2dG2v+n1dG1u+n22+dG2v+n12
uvEG1Δ1+n222δ1+n22+uvEG2Δ2+n122δ2+n12+
uVG1,vVG2Δ1+n2Δ2+n1δ1+n22+δ2+n12=
m1Δ1+n222δ1+n22+m2Δ2+n122δ2+n12+
n1n2Δ1+n2Δ2+n1δ12+δ22+n12+n22+2δ1n2+2δ2n1,

等号成立当且仅当dG1u=Δ1=δ1dG2v=Δ2=δ2, 其中, uV(G1)vV(G2), 即G1G2都是正则图。

证毕。

定理 2 设图G1G2是简单连通图, 有VG1=n1VG2=n2EG1=m1EG2=m2, 其最大度分别为Δ1Δ2, 最小度分别为δ1δ2, 那么

ISDDG1G2
m1Δ1+n222δ1+n22+n1m2Δ2+122δ2+12+
n1n2Δ1+n2Δ2+1δ12+δ22+n22+2δ1n2+2δ2+1,

等号成立当且仅当G1G2都是正则图。

证明G1G2的边集分为不相交的三部分, 即EG1G2=E1E2E3, 其中

E1=e  EG1G2,e  EG1
E2=e  EG1G2,e  EG2
E3=eE(G1G2,
e=uv, uVG2, vVG1

由两个图的冠积定义可得

dG1G2u=dG1u+n2,uVG1;dG2u+1,uVG2,

其中, uVG1G2

ISDDG1G2=uvEG1G2dG1G2udG1G2vdG1G22u+dG1G22v=
uvE1dG1u+n2dG1v+n2dG1u+n22+dG1v+n22+
n1uvE2dG2u+1dG2v+1dG2u+12+dG2v+12+
uvE3,uV1,vV2dG1u+n2dG2v+1dG1u+n22+dG2v+12
uvE1Δ1+n222δ1+n22+n1uvE2Δ2+122δ2+12+
uvE3,uV1,vV2Δ1+n2Δ2+1δ1+n22+δ2+12=
m1Δ1+n222δ1+n22+n1m2Δ2+122δ2+12+
n1n2Δ1+n2Δ2+1δ12+δ22+n22+2δ1n2+2δ2+1,

等号成立当且仅当dG1u=dG1v=Δ1=δ1dG2u=dG2v=Δ2=δ2, 即G1G2都是正则图时。

证毕。

定理 3 设图G1G2是简单连通图, 有VG1=n1VG2=n2EG1=m1EG2=m2, 其最大度分别为Δ1Δ2, 最小度分别为δ1δ2, 那么

ISDDG1×G2n1m2+n2m1Δ1+Δ222δ1+δ22

等号成立当且仅当G1G2都是正则图。

证明VG1=u1,u2,,un1,VG2=v1,v2,,vn2。由两个图的笛卡尔积定义, 可得

EG1×G2=EG1VG2+
EG2VG1
dG1×G2u,v=dG1u+dG2v

ISDDG1×G2=ui,vjuk,vlEG1×G2,ui,vjuk,vldG1×G2ui,vjdG1×G2uk,vldG1×G22ui,vj+dG1×G22uk,vl=
ui,vjui,vlEG1×G2,vjvlEG2dG1×G2ui,vjdG1×G2ui,vldG1×G22ui,vj+dG1×G22ui,vl+
ui,vjuk,vjEG1×G2,uiukEG1dG1×G2ui,vjdG1×G2uk,vjdG1×G22ui,vj+dG1×G22uk,vj=
uiVG1vjvlEG2dG1ui+dG2vjdG1ui+dG2vldG1ui+dG2vj2+dG1ui+dG2vl2+
vjVG2uiukEG1dG1ui+dG2vjdG1uk+dG2vjdG1ui+dG2vj2+dG1uk+dG2vj2
n1vjvlEG2Δ1+Δ222δ1+δ22+n2uiukEG1Δ1+Δ222δ1+δ22=
n1m2Δ1+Δ222δ1+δ22+n2m1Δ1+Δ222δ1+δ22=
n1m2+n2m1Δ1+Δ222δ1+δ22,

等号成立当且仅当dG1ui=dG1uk=Δ1=δ1,dG2vj=dG2vl=Δ2=δ2, 其中, uV(G1)vV(G2), 即G1G2都是正则图。

证毕。

定理 4 设图G1G2是简单连通图, 有VG1=n1VG2=n2EG1=m1EG2=m2, 其最大度分别为Δ1Δ2, 最小度分别为δ1δ2, 那么

ISDDG1G2
n22Δ12m2+n2Δ1M1G2+M2G2n12n2δ1+δ22+n22M2G1+n2Δ2M1G1+Δ22m1n222n2δ1+δ22,

其中,

M1G2=vjvlEG2dG2vj+dG2vl,
M2G2=vjvlEG2dG2vjdG2vl
M2G1=uiukEG1dG1uidG1uk,
M1G1=uiukEG1dG1ui+dG1uk,

等号成立当且仅当G1G2都是正则图。

证明VG1=u1,u2,,un1,VG2=v1,v2,,vn2。由两个图的字典序积定义可得

EG1G2=EG1VG22+EG2VG1
dG1G2u,v=n2dG1u+dG2v,

ISDDG1G2=ui,vjuk,vlEG1G2,ui,vjuk,vldG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl=
ui,vjui,vlEG1G2,jldG1G2ui,vjdG1G2ui,vldG1G22ui,vj+dG1G22ui,vl+ui,vjuk,vlEG1G2,ikdG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl=
uiVG1vjvlEG2n2dG1ui+dG2vjn2dG1ui+dG2vln2dG1ui+dG2vj2+n2dG1ui+dG2vl2+
uiukEG1vjVG2vlVG2n2dG1ui+dG2vjn2dG1uk+dG2vln2dG1ui+dG2vj2+n2dG1uk+dG2vl2=
n1vjvlEG2n2dG1ui+dG2vjn2dG1ui+dG2vln2dG1ui+dG2vj2+n2dG1ui+dG2vl2+
n22uiukEG1n2dG1ui+dG2vjn2dG1uk+dG2vln2dG1ui+dG2vj2+n2dG1uk+dG2vl2n1vjvlEG2n2Δ1+dG2vjn2Δ1+dG2vl2n2δ1+δ22+
n22uiukEG1n2dG1ui+Δ2n2dG1uk+Δ22n2δ1+δ22=
n12n2δ1+δ22vjvlEG2n22Δ12+n2Δ1dG2vj+dG2vl+dG2vjdG2vl+
n222n2δ1+δ22uiukEG1n22dG1uidG1uk+n2Δ2dG1ui+dG1uk+Δ22

M1G2=vjvlEG2dG2vj+dG2vl
M2G2=vjvlEG2dG2vjdG2vl
M2G1=uiukEG1dG1uidG1uk,
M1G1=uiukEG1dG1ui+dG1uk

式(2)式(3)代入式(1)中, 可得

ISDDG1G2n12n2δ1+δ22n22Δ12m2+n2Δ1M1G2+M2G2+n222n2δ1+δ22n22M2G1+n2Δ2M1G1+Δ22m1,

等号成立当且仅当dG1(ui)=dG1(uk)=Δ1=δ1dG2(vj)=dG2(vl)=Δ2=δ2, 其中, uV(G1)vV(G2), 即G1G2都是正则图。

证毕。

定理 5 设图G1G2是简单连通图, 有VG1=n1VG2=n2EG1=m1EG2=m2, 其最大度分别为Δ1Δ2, 最小度分别为δ1δ2, 那么

ISDDG1G2
n22m1+n12m2-4m1m2n2Δ1+n1Δ2-2δ1δ222n2δ1+n1δ2-2Δ1Δ22,

等号成立当且仅当G1G2都是正则图。

证明VG1=u1,u2,,un1,VG2=v1,v2,,vn2。由两个图的对称差定义, 得

EG1G2=EG1VG22+
EG2VG12-4EG1EG2,
dG1G2u,v=n2dG1u+n1dG2v-
2dG1udG2v,

ISDDG1G2=ui,vjuk,vlEG1G2dG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl=
vjVG2vlVG2uiukEG1dG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl+
uiVG1ukVG1vjvlEG2dG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl-
uiukEG1vjvlEG2dG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl

根据对称差定义, 则

dG1G2ui,vjdG1G2uk,vldG1G22ui,vj+dG1G22uk,vl=
n2dG1ui+n1dG2vj-2dG1uidG2vjn2dG1uk+n1dG2vl-2dG1ukdG2vln2dG1ui+n1dG2vj-2dG1uidG2vj2+n2dG1uk+n1dG2vl-2dG1ukdG2vl2n2Δ1+n1Δ2-2δ1δ222n2δ1+n1δ2-2Δ1Δ22

式(5)代入式(4)中得到

ISDDG1G2n22m1n2Δ1+n1Δ2-2δ1δ222n2δ1+n1δ2-2Δ1Δ22+n12m2n2Δ1+n1Δ2-2δ1δ222n2δ1+n1δ2-2Δ1Δ22-
4m1m2n2Δ1+n1Δ2-2δ1δ222n2δ1+n1δ2-2Δ1Δ22=n22m1+n12m2-4m1m2n2Δ1+n1Δ2-2δ1δ222n2δ1+n1δ2-2Δ1Δ22,

等号成立当且仅当dG1(ui)=dG1(uk)=Δ1=δ1dG2(vj)=dG2(vl)=Δ2=δ2, 其中, uV(G1)vV(G2), 即G1G2都是正则图。

证毕。

3 结论与展望

本文根据反对称分割指数的定义, 给出了G1+G2G1G2G1×G2G1G2G1G2图运算后的新图上界, 以及达到上界时所需的条件。此研究结果可作为一种预测方法, 对图运算下的其它有关顶点度的拓扑指数的研究有一定的借鉴意义, 后续可以研究其它指数的图运算, 也可发掘更多图运算的计算方法, 进一步丰富图运算的相关内容。

参考文献

[1]

BONDY J AMURTY U S R. Graph theory with applications[M]. London: Macmillan, 1976.

[2]

VUKIČEVIĆ D. Bond Additive Modeling 2. Mathematical properties of max-min rodeg index[J]. Croatica Chemica Acta201083(3): 261-273.

[3]

DAS K CMATEJIĆ MMILOVANOVIĆ Eet al. Bounds for symmetric division deg index of graphs[J]. Filomat201933(3): 683-698.

[4]

PALACIOS J L. New upper bounds for the symmetric division deg index of graphs[J]. Discrete Mathematics Letters2019(2): 52-56.

[5]

ALI A, ELUMALAI SMANSOUR T. On the symmetric division deg index of molecular graphs[J]. MATCH Communications in Mathematical and in Computer Chemistry202083(1): 205-220.

[6]

GHORBANI MZANGI SAMRAEI N. New results on symmetric division deg index[J]. Journal of Applied Mathematics and Computing202165(1): 161-176.

[7]

ALBALAHI A M, ALI A. On the inverse symmetric division deg index of unicyclic graphs[J]. Computation202210(10): 181.

[8]

DE NNAYEEM S M A, PAL A. F-Index of some graph operations[J]. Discrete Mathematics, Algorithms and Applications20168(2): 1650025.

[9]

PATTABIRAMAN K. Inverse sum indeg index of graphs[J]. AKCE International Journal of Graphs and Combinatorics201815(2): 155-167.

[10]

IMRAN MAKHTER SIQBAL Z. Edge Mostar index of chemical structures and nanostructures using graph operations[J]. International Journal of Quantum Chemistry2020120(15): e26259.

[11]

MODABISH AALAMERI AGUMAAN M Set al. The second Hyper-Zagreb index of graph operations[J]. Journal of Mathematics and Computer Science202111(2): 1455-1469.

[12]

WANG YINGHAFEEZ SAKHTER Set al. The generalized inverse sum indeg index of some graph operations[J]. Symmetry202214(11): 2349.

[13]

GUTMAN ITRINAJSTIĆ N. Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons[J]. Chemical Physics Letters197217(4): 535-538.

[14]

SHETTY B SLOKESHA VRANJINI P S. On the Harmonic index of graph operations[J]. Transactions on Combinatorics20154(4): 5-14.

[15]

ASHRAFI A RDOŠLIĆ THAMZEH A. The Zagreb coindices of graph operations[J]. Discrete Applied Mathematics2010158(15): 1571-1578.

[16]

DAS K CXU KCANGUL I Net al. On the Harary index of graph operations[J]. Journal of Inequalities and Applications2013(1): 1-16.

[17]

KHALIFEH M HYOUSEFI-AZARI HASHRAFI A R. The Hyper-Wiener index of graph operations[J]. Computers & Mathematics with Applications200856(5): 1402-1407.

基金资助

国家自然科学基金项目(61774137)

山西省回国留学人员科研项目(2022-149)

山西省自然科学基金项目(20210302124212)

山西省自然科学基金项目(202303021211154)

AI Summary AI Mindmap
PDF (435KB)

371

访问

0

被引

详细

导航
相关文章

AI思维导图

/