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

DOI10.1016/J.DAM.2022.02.007MaRDI QIDQ833005zbMATH OpenOpenAlexFDO

Authors Shuchao Li, Huihui Zhang, Yangyang 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

treediameterhitting timematching numbersegment sequence

Mathematics Subject Classification ID

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

Recommendations

• Extremal hitting times of trees with some given parameters
• Hitting times, cover cost, and the Wiener index of a tree
• The hitting times of random walks on bicyclic graphs
• Maximum hitting time for random walks on graphs
• Hitting times for random walks on tricyclic graphs

Cites work

• scientific article; zbMATH DE number 3163289 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• An explicit formula of hitting times for random walks on graphs
• Covering problems for Brownian motion on spheres
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Discrete Green's functions
• Discrete Green's functions and random walks on graphs
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Extremal cover times for random walks on trees
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Graph theory
• Hitting times for random walks on subdivision and triangulation graphs
• Hitting times, cover cost, and the Wiener index of a tree
• Maximum hitting time for random walks on graphs
• On hitting times of random walks on trees
• On the (reverse) cover cost of trees with some given parameters
• On the power of randomization in on-line algorithms
• Random walks and the effective resistance of networks
• Random walks on edge-transitive graphs. II
• Random walks on highly symmetric graphs
• Resistances and currents in infinite electrical networks
• The best mixing time for random walks on trees
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for graphs with cutpoints.
• The hitting time of random walk on unicyclic graphs
• The hitting times of random walks on bicyclic graphs
• Wiener index of trees: Theory and applications

Cited in

(3)

• Extremal hitting times of trees with some given parameters
• Hitting times for random walks on tricyclic graphs
• Hitting times of random walks on unicyclic graphs with a given number of pendant vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833005)