Abstract
Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. The class of bicyclic graphs of order n, denoted by ℬn, can be partitioned into two subclasses: the class [Formula: see text] of graphs which contain induced ∞-graphs, and the class [Formula: see text] of graphs which contain induced θ-graphs. Bose et al. [2] have found the graph having the minimal distance spectral radius in [Formula: see text]. In this paper, we determine the graphs having the minimal distance spectral radius in [Formula: see text]. These results together give a complete characterization of the graphs having the minimal distance spectral radius in ℬn.
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 callDisclaimer: 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.
