Some further results on the maximal hitting times of trees with some given parameters

DOI10.1016/J.DAM.2022.02.007zbMath1485.05086OpenAlexW4220732735MaRDI QIDQ833005

Huihui Zhang, Shuchao Li, Yang-yang Xu

Publication date: 28 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.007

zbMATH Keywords

treediametermatching numberhitting timesegment sequence

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Random walks on graphs (05C81)

Related Items (1)

Hitting times for random walks on tricyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The best mixing time for random walks on trees
• Random walks and the effective resistance of networks
• Resistances and currents in infinite electrical networks
• Random walks on highly symmetric graphs
• On hitting times of random walks on trees
• Covering problems for Brownian motion on spheres
• Random walks on edge-transitive graphs. II
• On the power of randomization in on-line algorithms
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for graphs with cutpoints.
• Discrete Green's functions
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Discrete Green's functions and random walks on graphs
• The hitting times of random walks on bicyclic graphs
• On the (reverse) cover cost of trees with some given parameters
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• An explicit formula of hitting times for random walks on graphs
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• Maximum hitting time for random walks on graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Extremal cover times for random walks on trees
• The hitting time of random walk on unicyclic graphs
• Wiener index of trees: Theory and applications

This page was built for publication: Some further results on the maximal hitting times of trees with some given parameters