Resistance distances and Kirchhoff index of graphs with an involution
From MaRDI portal
Publication:323076
DOI10.1016/j.dam.2016.07.001zbMath1346.05049OpenAlexW2498934592MaRDI QIDQ323076
Publication date: 7 October 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.001
Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (8)
Some spectral invariants of the neighborhood corona of graphs ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ Effective resistances and spanning trees in the complete bipartite graph plus a matching ⋮ Moore-Penrose inverse of the incidence matrix of a distance regular graph ⋮ Laplacian of a graph covering and its applications ⋮ Resistance distance of blowups of trees ⋮ Phase transition in spectral clustering based on resistance matrix ⋮ Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the resistance matrix of a graph
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Random walks and the effective resistance sum rules
- Enumerating spanning trees of graphs with an involution
- A recursion formula for resistance distances and its applications
- The number of spanning trees of plane graphs with reflective symmetry
- Resistance distances and the Kirchhoff index in double graphs
- Recursive calculation of effective resistances in distance-regular networks based on Bose–Mesner algebra and Christoffel–Darboux identity
- Metric and ultrametric spaces of resistances
- A new 5‐arc‐transitive cubic graph
- Enumeration of perfect matchings in graphs with reflective symmetry
This page was built for publication: Resistance distances and Kirchhoff index of graphs with an involution
