Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs

被引:21
|
作者
Zhao, Jing [1 ]
Liu, Jia-Bao [1 ,2 ]
Hayat, Sakander [3 ]
机构
[1] Anhui Jianzhu Univ, Sch Math & Phys, Hefei 230601, Anhui, Peoples R China
[2] Southeast Univ, Sch Math, Nanjing 210096, Jiangsu, Peoples R China
[3] GIK Inst Engn Sci & Technol, Fac Engn Sci, Topi 23460, Pakistan
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Laplacian; Normalized Laplacian; Kirchhoff index; Multiplicative degree-Kirchhoff index; Spanning tree; DEGREE-KIRCHHOFF INDEX; NORMALIZED LAPLACIAN;
D O I
10.1007/s12190-019-01306-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. Let On be a linear crossed octagonal graph. Recently, Pan and Li (Int J Quantum Chem 118(24):e25787, 2018) derived the closed formulas for the Kirchhoff index, multiplicative degree-Kirchhoff index and the number of spanning trees of Hn. They pointed that it is interesting to give the explicit formulas for the Kirchhoff and multiplicative degree-Kirchhoff indices of On. Inspired by these, in this paper, two resistance distance-based graph invariants, namely, Kirchhoff and multiplicative degree-Kirchhoff indices are studied. We firstly determine formulas for the Laplacian (normalized Laplacian, resp.) spectrum of On. Further, the formulas for those two resistance distance-based graph invariants and spanning trees are given. More surprising, we find that the Kirchhoff (multiplicative degree-Kirchhoff, resp.) index is almost one quarter to Wiener (Gutman, resp.) index of a linear crossed octagonal graph.
引用
收藏
页码:1 / 27
页数:27
相关论文
共 32 条
  • [1] Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
    Zhao, Jing
    Liu, Jia-Bao
    Hayat, Sakander
    Liu, Jia-Bao (liujiabaoad@163.com), 1600, Springer Science and Business Media Deutschland GmbH (63): : 1 - 2
  • [2] Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
    Jing Zhao
    Jia-Bao Liu
    Sakander Hayat
    Journal of Applied Mathematics and Computing, 2020, 63 : 1 - 27
  • [3] Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
    Li, Zhemin
    Xie, Zheng
    Li, Jianping
    Pan, Yingui
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 382 (382)
  • [4] Resistance distance-based graph invariants of subdivisions and triangulations of graphs
    Yang, Yujun
    Klein, Douglas J.
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 260 - 274
  • [5] Distance-based graph invariants of trees and the Harary index
    Wagner, Stephan
    Wang, Hua
    Zhang, Xiao-Dong
    FILOMAT, 2013, 27 (01) : 41 - 50
  • [6] On Distance-Based Graph Invariants
    Das, Kinkar Ch
    Mao, Yaping
    Gutman, Ivan
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021, 86 (02) : 375 - 393
  • [7] Resistance Distance-Based Indices and Spanning Trees of Linear Pentagonal-Quadrilateral Networks
    Ali, Umar
    Ahmad, Yasir
    Xu, Si-Ao
    Pan, Xiang-Feng
    POLYCYCLIC AROMATIC COMPOUNDS, 2022, 42 (09) : 6352 - 6371
  • [8] EXTREMAL PROPERTIES OF DISTANCE-BASED GRAPH INVARIANTS FOR k-TREES
    Zhang, Minjie
    Li, Shuchao
    MATHEMATICA BOHEMICA, 2018, 143 (01): : 41 - 66
  • [9] Variations of distance-based invariants of trees
    1600, Charles Babbage Research Centre (91):
  • [10] On the ordering of distance-based invariants of graphs
    Liu, Muhuo
    Das, Kinkar Ch.
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 324 : 191 - 201