On two conjectures concerning Kemeny's constant of graphs

Wei Li, Wensheng Sun, Yujun Yang

Kemeny's constant for a connected graph $G$, denoted by $\mathcal{K}(G)$, is the expected time for a random walk to reach a randomly chosen vertex $u$, regardless of the choice of…