On the Hitting Time Index of Broom Graphs
preprint
OA: closed
Abstract
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 in the literature.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00