The normalized Laplacians and random walks of the parallel subdivision graphs
Abstract
The -parallel subdivision graph is generated from which each edge of is replaced by parallel paths of length 2. The -parallel subdivision graph is constructed from which each edge of is replaced by parallel paths of length 3. In this paper, the normalized Laplacian spectra of and are given. They turn out that the multiplicities of the corresponding eigenvalues are only determined by . As applications, the expected hitting time, the expected commute time and any two-points resistance distance between vertices and of , the normalized Laplacian spectra of and with iterations are given. Moreover, the multiplicative degree Kirchhoff index, Kemeny's constant and the number of spanning tress of , , and are respectively obtained. Our results have generalized the previous works in Xie et al. and Guo et al. respectively.
Keywords
Cite
@article{arxiv.2004.02549,
title = {The normalized Laplacians and random walks of the parallel subdivision graphs},
author = {Jing Zhao and Jia-Bao Liu and Ying-Ying Tan and Sakander Hayat},
journal= {arXiv preprint arXiv:2004.02549},
year = {2020}
}