Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8901397 | Applied Mathematics and Computation | 2018 | 13 Pages |
Abstract
The k-triangle graph Tk(G) is obtained from a graph G by replacing each edge in G with k+1 parallel paths, in which one is of length 1 and each of the rest k paths is of length 2; whereas the k-quadrilateral graph Qk(G) is obtained from G by replacing each edge in G with k+1 parallel paths, in which one is of length 1 and each of the rest k paths is of length 3. In this paper, we completely determine the normalized Laplacian spectrum on Tk(G) (resp. Qk(G)) for any connected graph G, kâ¯â©¾â¯2. As applications, the correlation between the degree-Kirchhoff index, the Kemeny's constant and the number of spanning trees of Tk(G) (resp. Qk(G), the r-th iterative k-triangle graph Trk(G), the r-th iterative k-quadrilateral graph Qrk(G)) and those of G are derived. Our results extend those main results obtained in Xie et al. (2016) and Li and Hou (2017).
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jing Huang, Shuchao Li,