Zhang, Huihui; Li, Shuchao On the (reverse) cover cost of trees with some given parameters. (English) Zbl 1453.05122 Discrete Math. 344, No. 2, Article ID 112226, 17 p. (2021). MSC: 05C81 05C70 05C35 PDFBibTeX XMLCite \textit{H. Zhang} and \textit{S. Li}, Discrete Math. 344, No. 2, Article ID 112226, 17 p. (2021; Zbl 1453.05122) Full Text: DOI
Aksoy, Sinan G.; Chung, Fan; Tait, Michael; Tobin, Josh The maximum relaxation time of a random walk. (English) Zbl 1397.05096 Adv. Appl. Math. 101, 1-14 (2018). MSC: 05C50 05C81 05C35 60J10 PDFBibTeX XMLCite \textit{S. G. Aksoy} et al., Adv. Appl. Math. 101, 1--14 (2018; Zbl 1397.05096) Full Text: DOI arXiv
Georgakopoulos, Agelos; Wagner, Stephan Hitting times, cover cost, and the Wiener index of a tree. (English) Zbl 1359.05113 J. Graph Theory 84, No. 3, 311-326 (2017). MSC: 05C81 05C12 PDFBibTeX XMLCite \textit{A. Georgakopoulos} and \textit{S. Wagner}, J. Graph Theory 84, No. 3, 311--326 (2017; Zbl 1359.05113) Full Text: DOI arXiv
Gąsieniec, Leszek; Radzik, Tomasz Memory efficient anonymous graph exploration. (English) Zbl 1202.68277 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 14-29 (2008). MSC: 68R10 05C81 05C85 PDFBibTeX XMLCite \textit{L. Gąsieniec} and \textit{T. Radzik}, Lect. Notes Comput. Sci. 5344, 14--29 (2008; Zbl 1202.68277) Full Text: DOI