Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P2 and Kn
2020
The resistance distance (Kirchhoff index and multiplicative Kirchhoff index) and distance-based (Wiener index and Gutman index) graph invariants of ?n = P2 ×Kn are considered. Firstly by using the decomposition theorem, we procure the Laplacian and Normalized Laplacian spectrum for graph ?n, respectively. Based on which, we can procured the formulae for the number of spanning trees and some resistance distance and distance-based graph invariants of graph ?n. Also, it is very interesting to see that when n tends to infinity, Kf (?n) is a polynomial and W (?n) is a quadratic polynomial.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
2
Citations
NaN
KQI