Extremal cover cost and reverse cover cost of trees with given segment sequence
From MaRDI portal
Publication:2297740
DOI10.1016/J.DISC.2019.111791zbMATH Open1434.05138OpenAlexW2998592653WikidataQ126424982 ScholiaQ126424982MaRDI QIDQ2297740FDOQ2297740
Authors: Shuchao Li, Shujing Wang 
Publication date: 20 February 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111791
Recommendations
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
- On the (reverse) cover cost of trees with some given parameters
- Extremal problems for trees with given segment sequence
- Approximating the minmax rooted-tree cover in a tree
- Extremal cover cost and reverse cover cost of trees
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- Maximal covering tree problems
- Optimal direct and indirect covering trees
- The approximability of partial vertex covers in trees
Cites Work
- Wiener index versus maximum degree in trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Potential Theory on Distance-Regular Graphs
- Wiener index of trees: Theory and applications
- Distance in graphs
- On the sum of all distances in bipartite graphs
- Title not available (Why is that?)
- Greedy trees, caterpillars, and Wiener-type graph invariants
- Title not available (Why is that?)
- The extremal values of the Wiener index of a tree with given degree sequence
- Random walks on edge-transitive graphs. II
- Hitting times for random walks on vertex-transitive graphs
- Random walks on highly symmetric graphs
- Maximum Wiener index of trees with given degree sequence
- Random walks on edge transitive graphs
- Hitting times, cover cost, and the Wiener index of a tree
- Extremal problems for trees with given segment sequence
- On segment sequences and the Wiener index of trees
- Title not available (Why is that?)
- The expected hitting times for graphs with cutpoints.
- Discrete Green's functions and random walks on graphs
- The Steiner Wiener index of trees with a given segment sequence
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- Random walks on the triangular prism and other vertex-transitive graphs
- Chung-Yau invariants and graphs with symmetric hitting times
- The quotients between the (revised) Szeged index and Wiener index of graphs
Cited In (12)
- Extremal cover cost and reverse cover cost of trees
- Dumbbell graphs with extremal (reverse) cover cost
- Some further results on the maximal hitting times of trees with some given parameters
- On the extremal values for the Mostar index of trees with given degree sequence
- On the weighted reverse cover cost of trees and unicyclic graphs with given diameter
- On the extremal Mostar indices of trees with a given segment sequence
- On the (reverse) cover cost of trees with some given parameters
- Hitting times for random walks on tricyclic graphs
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
- Bounds on Kemeny's constant of trees with a prescribed matching number
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
This page was built for publication: Extremal cover cost and reverse cover cost of trees with given segment sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297740)
