Effective resistances and Kirchhoff index of ladder graphs
From MaRDI portal
(Redirected from Publication:282210)
Abstract: We explicitly compute the effective resistances between any two vertices of a ladder graph by using circuit reductions. Using our findings, we obtain explicit formulas for Kirchhoff index and admissible invariants of a ladder graph considering it as a model of a metrized graph. Comparing our formula for Kirchhoff index and previous results in literature, we obtain an explicit sum formula involving trigonometric functions. We also expressed our formulas in terms of certain generalized Fibonacci numbers that are the values of the Chebyshev polynomials of the second kind at .
Recommendations
Cites work
Cited in
(25)- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
- Algorithmic techniques for finding resistance distances on structured graphs
- Two-point resistances in the generalized phenylenes
- Complete characterization of resistance distance for linear octagonal networks
- Kirchhoff index for circulant graphs and its asymptotics
- Elementary formulas for Kirchhoff index of Möbius ladder and prism graphs
- Resistances between two nodes of a path network
- Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
- Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
- Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P₂ and K_n
- Effective resistances and Kirchhoff index in subdivision networks
- Minimizing Effective Resistance of a Graph
- Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix
- Extremal polygonal chains with respect to the Kirchhoff index
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
- Fractal and first-passage properties of a class of self-similar networks
- The Kirchhoff indices for circulant graphs
- Maximal polyomino chains with respect to the Kirchhoff index
- On the resistance distance and Kirchhoff index of K_n-chain(ring) network
- Resistance distances in the linear polyomino chain
- An Introductory Survey of Recursions in the Computation of Resistance Distance
- Explicit formulas for matrices associated to ladder, circular ladder, and Möbius ladder graphs
- Laplacian spectral metrics of some graph operations
- Kirchhoff indexes of a network
This page was built for publication: Effective resistances and Kirchhoff index of ladder graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282210)
