Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains
Abstract
Let Gn be a linear crossed polyomino chain with n 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 Gn are determined, respectively. It is interesting to find that the Kirchhoff (resp. multiplicative degree-Kirchhoff) index of Gn is approximately one quarter of its Wiener (resp. Gutman) index. More generally, let Grn be the set of subgraphs obtained by deleting r vertical edges of Gn, where 0≤slant r≤slant n+1. For any graph Grn∈ Grn, its Kirchhoff index and number of spanning trees are completely determined, respectively. Finally, we show that the Kirchhoff index of Grn is approximately one quarter of its Wiener index.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.