On the (reverse) cover cost of trees with some given parameters

Huihui Zhang, Shuchao Li

Type: Article

Publication Date: 2020-11-20

Citations: 6

DOI: https://doi.org/10.1016/j.disc.2020.112226

View Publication

Locations

Discrete Mathematics - View

Similar Works

Action	Title	Year	Authors
+	Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost	2021	Shuchao Li Shujing Wang
+	On the weighted reverse cover cost of trees and unicyclic graphs with given diameter	2024	LV Yan Zhouyang Chen Tingzeng Wu Pengli Zhang
+ PDF Chat	On the Tree Search Problem with Non-uniform Costs	2016	Ferdinando Cicalese Balázs Keszegh Bernard Lidický Dömötör Pálvölgyi Tomáš Valla
+	On the tree search problem with non-uniform costs	2016	Ferdinando Cicalese Balázs Keszegh Bernard Lidický Dömötör Pálvölgyi Tomáš Valla
+	Dumbbell Graphs with Extremal (Reverse) Cover Cost	2022	Zemin Jin Yumiao Shi Shujing Wang Xueyao Gui
+	Extremal cover cost and reverse cover cost of trees with given segment sequence	2019	Shuchao Li Shujing Wang
+	The Minimum Cover Cost of a Tree with Given Degree Sequence	2021	雁宇贾
+	Path Cover Problems with Length Cost	2023	Kenya Kobayashi Guohui Lin Eiji Miyano Toshiki Saitoh Akira Suzuki Tadatoshi Utashima Tsuyoshi Yagita
+	Bounds on the cover time	1989	Andrei Broder Anna R. Karlin
+ PDF Chat	On the Complexity of Searching in Trees: Average-Case Minimization	2010	Tobias Jacobs Ferdinando Cicalese Eduardo Sany Laber Marco Molinaro
+	On the greedy algorithm with random costs	1986	Colin McDiarmid
+	A measure of costs in balanced trees	1988	Leonardo Felician
+	A distributional study of the path edge-covering numbers for random trees	2008	PanholzerAlois
+ PDF Chat	Parameterized Complexity of Bandwidth on Trees	2014	Markus Sortland Dregi Daniel Lokshtanov
+ PDF Chat	Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time	2005	Seth Pettie
+	Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time	2005	Seth Pettie Xiaotie Deng Ding‐Zhu Du
+	On the Number of Trees for a Network	1960	Keats A. Pullen
+	On random minimum length spanning trees	1989	Alan Frieze Colin McDiarmid
+	On the number of matchings of a tree	2006	Stephan Wagner
+ PDF Chat	On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope	2018	Kaveh Khoshkhah Dirk Oliver Theis

Works That Cite This (6)

Action	Title	Year	Authors
+	On the weighted reverse cover cost of trees and unicyclic graphs with given diameter	2024	LV Yan Zhouyang Chen Tingzeng Wu Pengli Zhang
+	On ABC Estrada index of graphs	2021	Shuchao Li Lu Wang Huihui Zhang
+	The Minimum Cover Cost of a Tree with Given Degree Sequence	2021	雁宇贾
+	Some further results on the maximal hitting times of trees with some given parameters	2022	Shuchao Li Yangyang Xu Huihui Zhang
+	Hitting times for random walks on tricyclic graphs	2023	Xiaomin Zhu Xu Yang
+	Dumbbell Graphs with Extremal (Reverse) Cover Cost	2022	Zemin Jin Yumiao Shi Shujing Wang Xueyao Gui

Works Cited by This (34)

Action	Title	Year	Authors
+	Random Walks on Graphs: A Survey	2001	László Lovász
+	A Tractable Variant of Cover Time	2012	Agelos Georgakopoulos
+	Wiener indices of trees and monocyclic graphs with given bipartition	2011	Zhibin Du
+	Random walks and the effective resistance of networks	1991	Prasad Tetali
+	Mathematical Concepts in Organic Chemistry	1986	Iván Gutman O. E. Polansky
+	On a poset of trees	2010	Péter Csíkvári
+	Trees with minimal Laplacian coefficients	2010	Aleksandar Ilić
+	Discrete Greenʼs functions and random walks on graphs	2012	Hao Xu Shing‐Tung Yau
+	Random walks on edge transitive graphs	1998	José Luis Palacios José Miguel Renom Pedro Berrizbeitia
+	Extremal values on the eccentric distance sum of trees	2013	Xianya Geng Shuchao Li Meng Zhang