MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose that $A$ is a positive matrix and that we let $R$ be the diagonal matrix of $A$'s row-sums. What can be said about the spectrum of $R-A$? I am particularly interested in the largest eigenvalue of $R-A$.

share|cite|improve this question

It is just a point of view. But it is more long for writing it as a comment.

If $A$ be the adjacency matrix of graph $G$, then $R-A$ is its Laplacian matrix and there are some good bounds for the radius (or maximum eigenvalues of this matrix) of matrix. For example, if we denote the maximum eigenvalue of this matrix by $\mu$, we have: $$\mu\leq \sqrt(2)\times max(d(v)^2+\sum_{uv\in E(G)}{d(u)})^\frac{1}{2}$$ where $v$ changes in the vertices of the graph $G$. In most cases, we can extend such relations to the positive definite matrices. For more such bounds you can see the paper:

Bounds on the (Laplacian) spectral radius of graphs, written by $Lingsheng$ $Shi$ and published in Linear Algebra and Its Application.

But in general, as you want, I think there is not good bound.

share|cite|improve this answer
Shahrooz, I was not aware of the bound you mention. Do you know similar bounds for the normalized Laplacian of a graph? – Delio Mugnolo Feb 8 '13 at 8:43
In general no, but these references maybe good for further study: 1. "THE NORMALIZED LAPLACIAN MATRIX AND GENERAL RANDIC INDEX OF GRAPHS", a thesis by "Michael Scott Cavers" 2. "Generalizing some results to the normalized Laplacian" by "Steve Butler" – Shahrooz Janbaz Feb 8 '13 at 10:24
thanks a lot, shahrooz. – Delio Mugnolo Feb 8 '13 at 11:13

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.