On distance spectral radius of graphs

25Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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.© 2012 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Wang, Y., & Zhou, B. (2013). On distance spectral radius of graphs. Linear Algebra and Its Applications, 438(8), 3490–3503. https://doi.org/10.1016/j.laa.2012.12.024

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free