English

Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains

Combinatorics 2019-05-17 v1

Abstract

Let GnG_n be a linear crossed polyomino chain with nn four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the number of spanning trees of GnG_n are determined, respectively. It is interesting to find that the Kirchhoff (resp. multiplicative degree-Kirchhoff) index of GnG_n is approximately one quarter of its Wiener (resp. Gutman) index. More generally, let Gnr\mathcal{G}^r_n be the set of subgraphs obtained by deleting rr vertical edges of GnG_n, where 0rn+10\leqslant r\leqslant n+1. For any graph GnrGnrG^r_n\in \mathcal{G}^r_{n}, its Kirchhoff index and number of spanning trees are completely determined, respectively. Finally, we show that the Kirchhoff index of GnrG^r_n is approximately one quarter of its Wiener index.

Keywords

Cite

@article{arxiv.1905.06565,
  title  = {Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains},
  author = {Yingui Pan and Jianping Li},
  journal= {arXiv preprint arXiv:1905.06565},
  year   = {2019}
}