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

DOI10.1016/j.disc.2019.111791zbMath1434.05138OpenAlexW2998592653WikidataQ126424982 ScholiaQ126424982MaRDI QIDQ2297740

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) Connectivity (05C40) Vertex degrees (05C07) Random walks on graphs (05C81)

Related Items

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, Hitting times for random walks on tricyclic graphs, Bounds on Kemeny's constant of trees with a prescribed matching number, On the (reverse) cover cost of trees with some given parameters, Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost, 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, Dumbbell graphs with extremal (reverse) cover cost, On the extremal Mostar indices of trees with a given segment sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems for trees with given segment sequence
• Random walks on highly symmetric graphs
• The extremal values of the Wiener index of a tree with given degree sequence
• Random walks on the triangular prism and other vertex-transitive graphs
• Random walks on edge-transitive graphs. II
• Random walks on edge transitive graphs
• The expected hitting times for graphs with cutpoints.
• Wiener index versus maximum degree in trees
• 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
• The Steiner Wiener index of trees with a given segment sequence
• On the sum of all distances in bipartite graphs
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• Hitting times for random walks on vertex-transitive graphs
• Distance in graphs
• Potential Theory on Distance-Regular Graphs
• The quotients between the (revised) Szeged index and Wiener index of graphs
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Chung-Yau Invariants and Graphs with Symmetric Hitting Times
• Wiener index of trees: Theory and applications