Sharp upper bounds on the distance spectral radius of a graph

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Let M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eigenvalue of M is called the spectral radius of the matrix M, denoted by ρ(M). In this paper, we give two sharp upper bounds of the spectral radius of matrix M. As corollaries, we give two sharp upper bounds of the distance matrix of a graph. © 2013 The Authors.

Cite

CITATION STYLE

APA

Chen, Y., Lin, H., & Shu, J. (2013). Sharp upper bounds on the distance spectral radius of a graph. Linear Algebra and Its Applications, 439(9), 2659–2666. https://doi.org/10.1016/j.laa.2013.07.023

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