Answers are grounded in this paper and cite their sources.
Randomized analysis derives closed-form formulas for hitting time index in broom graphs, indicating extended applicability.
A broom graph is a linear graph with some pendant vertices attached to one of its ends. Using the formula for the commute time of the random walk between two vertices of the graph, which is given in terms of the effective resistance between the vertices, we find closed-form formulas for the hitting time index of some families of broom graphs, extending results found by He et al.
No takes yet. Share an insight, caveat, or question.
José Luis Palacios (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: