Further results on the expected hitting time, the cover cost and the related invariants of graphs

DOI10.1016/j.disc.2018.09.019zbMath1400.05218arXiv1707.02002OpenAlexW2963958064MaRDI QIDQ1618224

Jing Huang, Shuchao Li, Zheng Xie

Publication date: 13 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02002

zbMATH Keywords

random walkhitting timeKirchhoff indexcover costreverse cover cost

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random walks on graphs (05C81)

Related Items (13)

Some further results on the maximal hitting times of trees with some given parameters ⋮ On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain ⋮ Extremal hitting times of trees with some given parameters ⋮ Hitting times for random walks on tricyclic graphs ⋮ Two-point resistances in the generalized phenylenes ⋮ Bounds on Kemeny's constant of trees with a prescribed matching number ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ Bicyclic graphs with extremal cover cost ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ The hitting times of random walks on bicyclic graphs ⋮ The hitting time of random walk on unicyclic graphs ⋮ Dumbbell graphs with extremal (reverse) cover cost

Cites Work

• The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
• On the Ihara zeta function and resistance distance-based indices
• On a conjecture concerning spanning tree invariants and loop systems
• Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
• Random walks and the effective resistance of networks
• Resistance distance and the normalized Laplacian spectrum
• Bounds on expected hitting times for a random walk on a connected graph
• The hitting and cover times of random walks on finite graphs using local degree information
• Expected hitting times for a random walk on a connected graph
• The electrical resistance of a graph captures its commute and cover times
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
• More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
• Discrete Green's functions and random walks on graphs
• Spanning trees and random walks on weighted graphs
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications
• Decomposing hitting times of walks on graphs into simpler ones
• Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• On the sum of all distances in bipartite graphs
• An explicit formula of hitting times for random walks on graphs
• Mathematical aspects of Wiener index
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• The Hitting Time of Multiple Random Walks
• Uniqueness of electrical currents in a network of finite total resistance
• Distance in graphs
• Chung-Yau Invariants and Graphs with Symmetric Hitting Times
• ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Further results on the expected hitting time, the cover cost and the related invariants of graphs