首页> 外文期刊>Journal of Applied Mathematics and Computing >Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
【24h】

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

机译:基于抵抗距离的图形不变和线性交叉八角图的跨越树的数量

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:电阻距离是一种新型距离功能,也是一种新的内在图形指标,这使得普通距离的一些延伸。让我们成为一个线性交叉的八角形图。最近,Pan和Li(int J Quantum Chem 118(24):E25787,2018)来源于Kirchhoff指数,乘法程度 - 柯彻夫夫指数和HN的跨度树数的封闭式公式。他们指出,为Kirchhoff和乘法学位 - 柯彻夫夫索引提供明确的公式很有意思。受这些启发,本文研究了两个基于抵抗距离的图形不变,即Kirchhoff和乘法程度 - 基洛夫索引。我们首先确定Laplacian(标准化Laplacian,RESP。)的公式。此外,给出了那些两种电阻距离的图形不变量和跨越树的公式。更令人惊讶的是,我们发现Kirchhoff(乘法学位 - Kirchhoff,Resp。)指数几乎是一个季度到维纳(Gutman,Resp。)线性交叉八角形图的索引。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号