Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs
From MaRDI portal
Publication:5012997
zbMATH Open1474.92151arXiv2007.03103MaRDI QIDQ5012997FDOQ5012997
Authors: Nolan Faught, Mark Kempton, Adam Knudson 
Publication date: 26 November 2021
Abstract: We obtain a general formula for the resistance distance (or effective resistance) between any pair of nodes in a general family of graphs which we call flower graphs. Flower graphs are obtained from identifying nodes of multiple copies of a given base graph in a cyclic way. We apply our general formula to two specific families of flower graphs, where the base graph is either a complete graph or a cycle. We also obtain bounds on the Kirchhoff index and Kemeny's constant of general flower graphs using our formula for resistance. For flower graphs whose base graph is a complete graph or a cycle, we obtain exact, closed form expressions for the Kirchhoff index and Kemeny's constant.
Full work available at URL: https://arxiv.org/abs/2007.03103
Recommendations
- Resistance distances and the Kirchhoff index in Cayley graphs
- Kemeny's constant and the effective graph resistance
- Resistance distance and Kirchhoff index for a class of graphs
- Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs
- Kemeny's constant for several families of graphs and real-world networks
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cited In (3)
This page was built for publication: Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012997)
