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

DOI10.1016/J.DAM.2022.02.007zbMATH Open1485.05086OpenAlexW4220732735MaRDI QIDQ833005FDOQ833005

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

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

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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• On the power of randomization in on-line algorithms
• Title not available (Why is that?)
• Maximum hitting time for random walks on graphs
• Wiener index of trees: Theory and applications
• On hitting times of random walks on trees
• Random walks and the effective resistance of networks
• Random walks on edge-transitive graphs. II
• Extremal cover times for random walks on trees
• The best mixing time for random walks on trees
• Title not available (Why is that?)
• The electrical resistance of a graph captures its commute and cover times
• Resistances and currents in infinite electrical networks
• Covering problems for Brownian motion on spheres
• Random walks on highly symmetric graphs
• Hitting times, cover cost, and the Wiener index of a tree
• The expected hitting times for graphs with cutpoints.
• Discrete Green's functions
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Discrete Green's functions and random walks on graphs
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• The hitting times of random walks on bicyclic graphs
• On the (reverse) cover cost of trees with some given parameters
• An explicit formula of hitting times 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
• The hitting time of random walk on unicyclic graphs

Cited In (2)

• Extremal hitting times of trees with some given parameters
• Hitting times for random walks on tricyclic graphs

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)