Bicyclic graphs with extremal cover cost

作者：

Highlights：

• highlights

• Reveal a close connection between the cover cost and some related graph invariants of bicyclic graphs.

• Present sharp upper and lower bounds of cover cost among all bicyclic graphs of order n.

• Characterize the corresponding extremal graphs.

摘要

highlights•Reveal a close connection between the cover cost and some related graph invariants of bicyclic graphs.•Present sharp upper and lower bounds of cover cost among all bicyclic graphs of order n.•Characterize the corresponding extremal graphs.

论文关键词：Bicyclic graph,Expected hitting time,Cover cost

论文评审过程：Received 5 November 2020, Revised 14 March 2021, Accepted 19 March 2021, Available online 24 April 2021, Version of Record 24 April 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126235