Kemeny's constant for a graph with bridges
Combinatorics
2022-05-18 v1
Abstract
In this paper, we determine a formula for Kemeny's constant for a graph with multiple bridges, in terms of quantities that are inherent to the subgraphs obtained upon removal of all bridges and that can be computed independently. With the formula, we consider several optimization problems for Kemeny's constant for graphs with bridges, and we remark on the computational benefit of this formula for the computation of Kemeny's constant. Finally, we discuss some potential applications.
Keywords
Cite
@article{arxiv.2205.08235,
title = {Kemeny's constant for a graph with bridges},
author = {Jane Breen and Emanuele Crisostomi and Sooyeong Kim},
journal= {arXiv preprint arXiv:2205.08235},
year = {2022}
}
Comments
21 pages and 3 figures