Abstract
Let G be a simple connected graph and Let be the expected hitting time from x to y in G and be the hitting time of G, where A tricyclic graph is a simple connected graph that the edge number equals the vertex number plus two. Let be the set of all n-vertex tricyclic graphs. In this article, we will determine the extremal graphs for hitting times among all n-vertex tricyclic graphs. Moreover, if then we will obtain sharp upper and lower bounds for
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
