<span class="word">On <span class="word">the <span class="word"><span class="changedDisabled">Hitting <span class="word"><span class="changedDisabled">Time <span class="word"><span class="changedDisabled">Index <span class="word">of <span class="word"><span class="changedDisabled">Broom <span class="word"><span class="changedDisabled">Graphs
Discuss this preprint
Start a discussion What are Sciety discussions?Listed in
This article is not in any list yet, why not save it to one of your lists.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.