Search arXivSearch

arXiv · 2603.22023

Kirchhoff index of a nested geometric graph with weighted multiple edges

Abstract

Kirchhoff index, Kf(G), introduced by Klein and Randic in 1993, represents the total effective resistances between all pairs of vertices in a graph G, where each edge is regarded as a resistor. In this paper, the Kirchhoff indices of a particular sequence of nested geometric graphs with weighted multiple edges, denoted by Gn, are investigated. A recurrence relation for the characteristic polynomial of the Laplacian matrix L(Gn) is derived, and an explicit formula for Kf(Gn) is obtained. These facilitate the analysis of the variation of Kf(Gn) as as n goes to infinity. Consequently, Kf(Gn) is shown to grow asymptotically linearly, characterized by a specific asymptotic formula. In the course of this derivation, a recurrence relation for the determinant of a block tridiagonal matrix is established. The Kirchhoff index of a 4-regular graph constructed from Gn is also determined.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Da-yeon Huh. 2026-03-26. Kirchhoff index of a nested geometric graph with weighted multiple edges. https://arxiv.org/abs/2603.22023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO