Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs
Combinatorics
2020-07-08 v1
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.
Keywords
Cite
@article{arxiv.2007.03103,
title = {Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs},
author = {Nolan Faught and Mark Kempton and Adam Knudson},
journal= {arXiv preprint arXiv:2007.03103},
year = {2020}
}
Comments
20 pages