Abstract
We determine the unique tree of given domination number with minimum distance spectral radius and the unique connected graph (tree) of given domination number with maximum distance spectral radius. We also determine the unique tree of given bipartition size with minimum distance spectral radius and the unique connected bipartite graph (tree) of given bipartition size with maximum distance spectral radius. Finally, we determine the unique trees with the second and the third minimum (maximum, respectively) distance spectral radii among the trees on n⩾6 vertices.
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.
