JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2026, Vol. 61 ›› Issue (4): 92-101.doi: 10.6040/j.issn.1671-9352.0.2024.330

Previous Articles    

Resistance distance and Kirchhoff index in graph operation

SHEN Yunrui, MEI Yinzhen*   

  1. School of Mathematics, North University of China, Taiyuan 030051, Shanxi, China
  • Published:2026-04-08

Abstract: Let G be an undirected connected graph, ST(G),ZT(G),HT(G)are the operation graphs of G. By utilizing the principles of electrical networks and combinatorial methods, the Kirchhoff indices of ST(G),ZT(G),HT(G) are obtained, as well as the relationships between the Kirchhoff indices of graph operations and the Kirchhoff index of G, multiplicative degree-Kirchhoff index, additive degree-Kirchhoff index, the number of edges, and the number of vertices.

Key words: resistance distance, Kirchhoff index, multiplicative degree-Kirchhoff index, additive degree-Kirchhoff index

CLC Number: 

  • O157
[1] 邦迪J A,默蒂U S R. 图论及其应用[M]. 北京:科学出版社,1984. BONDY J A, MURTY U S R. Graph theory with applications[M]. Beijing: Science Press, 1984.
[2] CHEN Haiyan, ZHANG Fuji. Resistance distance and the normalized Laplacian spectrum[J]. Discrete Applied Mathematics, 2007, 155(5):654-661.
[3] GUTMAN I, FENG L H, YU G H. On the degree resistance distance of unicyclic graphs[J]. Transactions on Combinatorics, 2012, 1(2):27-40.
[4] LIU Jiabao, PAN Xiangfeng, HU Futao. The {1}-inverse of the Laplacian of subdivision vertex and subdivision edge corona with applications[J]. Linear Multilinear Algebra, 2017, 65(1):178-191.
[5] LIU Qun, LIU Jiabao, WANG Shaohui. Resistance distance and Kirchhoff index of the corona-vertex and corona-edge of subdivision graph[J]. IEEE Access, 2018, 6:55673-55679.
[6] LIU Qun. Resistance distance and Kirchhoff index of generalized subdivision-vertex and subdivision-edge corona for graphs[J]. IEEE Access, 2019, 7:92240-92247.
[7] CAO Jinde, LIU Jiabao, WANG Shaohui. Resistance distance in corona and neighborhood corona networks based on Laplacian generalized inverse approach[J]. Journal of Algebra and Its Applications, 2019, 18(3):1950053.
[8] 殷剑宏,汪荣贵. 超立方体的拉普拉斯矩阵的谱[J]. 浙江大学学报(理学版),2007,34(3):321-323. YIN Jianhong, WANG Ronggui. Spectra of Laplacian matrices of hypercubes[J]. Journal of Zhejiang University(Science Edition), 2007, 34(3):321-323.
[9] CHEN Haiyan. Random walks and the effective resistance sum rules[J]. Discrete applied mathematics, 2010, 158(15):1691-1700.
[10] GAO Xing, LUO Yanfeng, LIU Wenwen. Kirchhoff index in line, subdivision and total graphs of a regular graph[J]. Discrete Applied Mathematics, 2012, 160(4/5):560-565.
[11] YANG Yujun, KLEIN D J. Resistance distance-based graph invariants of subdivision and triangulations of graphs[J]. Discrete Applied Mathematics, 2015, 181:260-274.
[12] WANG Weizhong, YANG Dong, LUO Yanfeng. The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs[J]. Discrete Applied Mathematics, 2013, 161(18):3063-3071.
[13] 于越. 图运算的电阻距离和可控性[D]. 烟台:烟台大学,2021. YU Yue. The resistance distance and controllability of graph operations[D]. Yantai: Yantai University, 2021.
[14] LIU Jiabao, PAN Xiangfeng, HU Futao. The Laplacian polynomial of graphs derived from regular graphs and applications[J]. Ars Combinatorial, 2016, 126:289-300.
[15] KLEIN D J. Resistance-distance sum rules[J]. Croatica Chemica Act, 2002, 75(2):633-649.
[16] BOLLOBÁS B. Random graphs[M]. New York: Springer, 2011.
[1] Fei LEI,Fei WEN,Zepeng LI,Muchun LI. Vertex reducible edge coloring of the Lexicographic product of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(10): 107-114.
[2] Ziqiang FANG,Longjie LI,Haizhen REN. Spectra of product operation signed graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(10): 101-106.
[3] Yinzhen MEI,Huifeng FU. Sombor index on four operation graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 56-63.
[4] Li WANG,Jingwen LI,Wenzhu YANG,Huayan PEI. Adjacent vertex reducible total labeling of unicyclic graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 44-55.
[5] Kaiyang HU,Mingfang HUANG,Baolin MA. Vertex-distinguishing E-total coloring of complete bipartite graph K12, n for 12≤n≤88 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 36-43, 70.
[6] Yongjun WANG,Xiang CHEN. Vertex distinguishing general total colorings of complete 3-partite graphs by multisets [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 29-35.
[7] Hongyu CHEN. Linear arboricity in graphs of low treewidth [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 25-28, 35.
[8] Haicheng MA,Xiaojie YOU. Extremum of the matching maximum root of k-bridge graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 19-24.
[9] Ruiying XUE,Zongtian WEI,Meijuan ZHAI. Restricted burning connectivity of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 91-99, 109.
[10] Li ZHU,Peng LI,Aifa WANG. Study on semi-paired k-disjoint path cover of unit interval graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 80-90.
[11] Yanan SU,Chunling TONG,Yong LI,Senyuan SU. Equitable total coloring of generalized Petersen graphs P(n, k) [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 71-79.
[12] Chaofan LIANG,Fenjin LIU,Yuchao LI,Shunyi LIU. Construction of singularly cospectral graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 65-70.
[13] Yaxin SHI,Fengxia LIU,Hua CAI. On r-hued coloring of WnPm [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 59-64.
[14] Jiaxin YUAN,Mingfang HUANG. Strong edge-coloring of graphs without K1, 3+ [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 53-58.
[15] Huan LIU,Huiying QIANG,Hongshen WANG,Yu BAI. 2-distance sum distinguishing coloring of trees [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 47-52, 58.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!