Effective resistances and Kirchhoff index of ladder graphs

DOI10.1007/S10910-016-0597-8zbMATH Open1356.05032arXiv1503.06353OpenAlexW2288594268MaRDI QIDQ282210FDOQ282210

Authors: Zübeyir Çınkır 

Publication date: 12 May 2016

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

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 $2$.

Full work available at URL: https://arxiv.org/abs/1503.06353

Recommendations

• Kirchhoff indexes of a network
• scientific article; zbMATH DE number 6178130
• scientific article; zbMATH DE number 5942974
• Elementary formulas for Kirchhoff index of Möbius ladder and prism graphs
• On the Kirchhoff index of some toroidal lattices

zbMATH Keywords

Kirchhoff indexcircuit reductioneffective resistanceladder graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Probability on trees and networks
• Resistance distance in wheels and fans
• Spanning tree formulas and Chebyshev polynomials
• The Fibonacci Numbers: Exposed

Cited In (20)

• Fractal and first-passage properties of a class of self-similar networks
• Complete characterization of resistance distance for linear octagonal networks
• Minimizing Effective Resistance of a Graph
• Elementary formulas for Kirchhoff index of Möbius ladder and prism graphs
• Resistances between two nodes of a path network
• Spectral analysis of three invariants associated to random walks on rounded networks with \(2n\)-pentagons
• Resistance distances in the linear polyomino chain
• Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
• Kirchhoff indexes of a network
• On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
• Extremal polygonal chains with respect to the Kirchhoff index
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• Kirchhoff index for circulant graphs and its asymptotics
• Algorithmic techniques for finding resistance distances on structured graphs
• The Kirchhoff indices for circulant graphs
• Effective resistances and Kirchhoff index in subdivision networks
• Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of \(P_2\) and \(K_n\)
• The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
• Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix
• Two-point resistances in the generalized phenylenes

Uses Software

• Mathematica
• OEIS

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)