Abstract
The distance spectral radius of a graph is the largest eigenvalue of its distance matrix. X.L. Zhang (2012) [31] determined the n-vertex graphs of given diameter with the minimum distance spectral radius. In this paper, we generalize this result by characterizing the graphs of order n with given connectivity and diameter having minimum distance spectral radius. In addition, we determine the minimum distance spectral radius of graphs among the n-vertex graphs with given connectivity and independence number, and characterize the corresponding extremal graph, thus determining the minimum distance spectral radius of graphs among n-vertex graphs with given connectivity (resp. independence) number.
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.
