On the (reverse) cover cost of trees with some given parameters
From MaRDI portal
Publication:2214070
DOI10.1016/j.disc.2020.112226zbMath1453.05122OpenAlexW3109442107MaRDI QIDQ2214070
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112226
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81)
Related Items (4)
Some further results on the maximal hitting times of trees with some given parameters ⋮ Hitting times for random walks on tricyclic graphs ⋮ On ABC Estrada index of graphs ⋮ Dumbbell graphs with extremal (reverse) cover cost
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some extremal properties of the multiplicatively weighted Harary index of a graph
- Orientations of graphs with maximum Wiener index
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
- On a poset of trees
- Random walks and the effective resistance of networks
- Random walks on highly symmetric graphs
- Trees with minimal Laplacian coefficients
- On hitting times of random walks on trees
- Comparison of graphs by their number of spanning trees
- Random walks on edge-transitive graphs. II
- On the power of randomization in on-line algorithms
- Collecting coupons on trees, and the cover time of random walks
- The expected hitting times for graphs with cutpoints.
- 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
- Spanning trees and random walks on weighted graphs
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- Random walks on complete multipartite graphs
- Extremal values on the eccentric distance sum of trees
- On the sum of all distances in bipartite graphs
- Walks and paths in trees
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- The Hitting Time of Multiple Random Walks
- Distance in graphs
- Potential Theory on Distance-Regular Graphs
- The quotients between the (revised) Szeged index and Wiener index of graphs
- Extremal cover times for random walks on trees
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times
- WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
- Wiener index of trees: Theory and applications
This page was built for publication: On the (reverse) cover cost of trees with some given parameters
