On the Hitting Time Index of Broom Graphs

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.