科研速览 · Science Skim继续刷下去 · Keep skimming →
◆ AppliedMath2026-06-10· Mathematics

Hitting Time Index for Broom Graphs

Sonja Orlić, José Luis Palacios, Aleksandar Petojević

原始摘要(英文原文)· Original abstract
Thehitting time index HT(G) is a recently introduced topological descriptor based on expected hitting times of a random walk on a graph. In this paper, we derive a closed-form formula for HT(G) for broom graphs Bn,d that holds for all parameters 2≤d≤n−1, HT(Bn,d)=S1+S2+S3+(n−d)∑i=1d−1max{A(i),B(i)}, where S1,S2,S3,A(i),B(i) are explicitly defined. For d≥2 and n≥4d−8 we derive a simpler cubic polynomial formula in n, HT(Bn,d)=n3+adn2+bdn+cd, with explicitly given coefficients ad,bd,cd depending only on d. We also consider quartic polynomial formulas for special cases.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

Hitting Time Index for Broom Graphs — 科研速览 Science Skim