Bicyclic graphs with extremal cover cost

DOI10.1016/J.AMC.2021.126235OpenAlexW3158185728MaRDI QIDQ2243234

Yanyan Li

Publication date: 11 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126235

zbMATH Keywords

bicyclic graphexpected hitting timecover cost

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (1)

Dumbbell graphs with extremal (reverse) cover cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture concerning spanning tree invariants and loop systems
• Random walks and the effective resistance of networks
• Complete characterization of bicyclic graphs with minimal Kirchhoff index
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• On the sum of all distances in a graph or digraph

This page was built for publication: Bicyclic graphs with extremal cover cost