Article citationsMore>>

Chandra, A.K., Raghavan, P., Ruzzo, W.L. and Smolensky, R. (1989) The Electrical Resistance of a Graph Captures Its Commute and Cover Times. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing—STOC’89, Seattle, 14-17 May 1989, 574-586.
https://doi.org/10.1145/73007.73062

has been cited by the following article:

• TITLE: On the Hitting Time Index of Graphs

  AUTHORS: José Luis Palacios, Arianna Santamaría

  KEYWORDS: Edge-Transitive Graphs, Cayley Graphs, Kirchhoff Index

  JOURNAL NAME: Open Journal of Applied Sciences, Vol.15 No.8, August 27, 2025

  ABSTRACT: The hitting time index of a simple connected undirected graph G is a recently defined topological descriptor, HT( G ) , which is computed using the expected hitting times of the random walk on G . In this article, we find a new upper bound for HT( G ) , given in terms of the Kirchhoff index, and a new degree-weighted Kirchhoff index. Then we look at HT( G ) when G is edge transitive, both in the regular and non-regular cases. We find closed-form formulas for some families of Cayley graphs, the complete bipartite graphs K m,n , and some subdivision graphs.