Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs

DOI10.1016/j.amc.2021.126283OpenAlexW3157603228MaRDI QIDQ2243268

José Luis Palacios, Greg Markowsky

Publication date: 11 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

random walksKirchhoff indexKemeny constantelectric networkshighly symmetric graphs

Mathematics Subject Classification ID

Graph theory (05Cxx)

Related Items (2)

Bounds on Kemeny's constant of trees with a prescribed matching number ⋮ Extremal pentagonal chains with respect to the Kirchhoff index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the resistance matrix of a graph
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• Kirchhoff index of composite graphs
• The normalized Laplacian spectrum of subdivisions of a graph
• Bounds for the Kirchhoff index via majorization techniques
• The Braess' paradox for pendent twins
• Kemeny's constant for several families of graphs and real-world networks
• Resistance characterizations of equiarboreal graphs
• Kemeny's constant and the effective graph resistance
• Resistance matrices of graphs with matrix weights
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs

This page was built for publication: Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs