Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost

DOI10.1016/j.disc.2021.112432zbMath1466.05034OpenAlexW3155149782MaRDI QIDQ2032849

Shujing Wang, Shuchao Li

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112432

zbMATH Keywords

\(k\)-ary treecover costreverse cover costtotally balanced tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Random walks on graphs (05C81)

Related Items

Hitting times for random walks on tricyclic graphs ⋮ Bounds on Kemeny's constant of trees with a prescribed matching number ⋮ Dumbbell graphs with extremal (reverse) cover cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary trees with the largest number of subtrees
• Random walks on highly symmetric graphs
• Corrigendum: 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
• On subtrees of trees
• Superdominance order and distance of trees with bounded maximum degree
• Discrete Green's functions and random walks on graphs
• On \(\sigma\)-span and \(F\)-span of trees and full binary trees
• Some extremal ratios of the distance and subtree problems in binary trees
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Vertex-based and edge-based centroids of graphs
• 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
• Centers to centroids in 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