Extremal cover cost and reverse cover cost of trees with given segment sequence

DOI10.1016/J.DISC.2019.111791MaRDI QIDQ2297740zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

segment sequencecover costreverse cover cost

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Connectivity (05C40) Random walks on graphs (05C81)

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

• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 5627542 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 6750302 (Why is no real title available?)
• Chung-Yau invariants and graphs with symmetric hitting times
• Discrete Green's functions and random walks on graphs
• Distance in graphs
• Extremal problems for trees with given segment sequence
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Greedy trees, caterpillars, and Wiener-type graph invariants
• Hitting times for random walks on vertex-transitive graphs
• Hitting times, cover cost, and the Wiener index of a tree
• Maximum Wiener index of trees with given degree sequence
• On segment sequences and the Wiener index of trees
• On the sum of all distances in bipartite graphs
• Potential Theory on Distance-Regular Graphs
• Random walks on edge transitive graphs
• Random walks on edge-transitive graphs. II
• Random walks on highly symmetric graphs
• Random walks on the triangular prism and other vertex-transitive graphs
• The Steiner Wiener index of trees with a given segment sequence
• The expected hitting times for graphs with cutpoints.
• The extremal values of the Wiener index of a tree with given degree sequence
• The quotients between the (revised) Szeged index and Wiener index of graphs
• Wiener index of trees: Theory and applications
• Wiener index versus maximum degree in trees

Cited in

(12)

• Dumbbell graphs with extremal (reverse) cover cost
• Extremal cover cost and reverse cover cost of trees
• 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 extremal Mostar indices of trees with a given segment sequence
• On the weighted reverse cover cost of trees and unicyclic graphs with given diameter
• 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)