Suppose that $A$ is an $n\times n$ nonnegative matrix whose eigenvalues are $\lambda = \rho (A), \lambda _2,\ldots , \lambda _n$. Fiedler and others have shown that $\det (\lambda I - A) \le \lambda ^n - \rho ^n$, for all $\lambda > \rho $, with equality for any such $\lambda $ if and only if $A$ is the simple cycle matrix. Let $a_i$ be the signed sum of the determinants of the principal submatrices of $A$ of order $i\times i$, $i = 1,\ldots ,n - 1$. We use similar techniques to Fiedler to show that Fiedler’s inequality can be strengthened to: $\det (\lambda I - A) + \sum _{i = 1}^{n - 1} \rho ^{n - 2i}|a_i|(\lambda - \rho )^i \le \lambda ^n -\rho ^n$, for all $\lambda \ge \rho $. We use this inequality to derive the inequality that: $\prod _{2}^{n}(\rho - \lambda _i) \le \rho ^{n - 2}\sum _{i = 2}^{n}(\rho - \lambda _i)$. In the spirit of a celebrated conjecture due to Boyle-Handelman, this inequality inspires us to conjecture the following inequality on the nonzero eigenvalues of $A$: If $\lambda _1 = \rho (A),\lambda _2,\ldots , \lambda _k$ are (all) the nonzero eigenvalues of $A$, then $\prod _{2}^{k}(\rho - \lambda _i) \le \rho ^{k-2}\sum _{i = 2}^{k}(\rho -\lambda )$. We prove this conjecture for the case when the spectrum of $A$ is real.
Let $A$ be an $n\times n$ symmetric, irreducible, and nonnegative matrix whose eigenvalues are $\lambda _1 > \lambda _2 \ge \ldots \ge \lambda _n$. In this paper we derive several lower and upper bounds, in particular on $\lambda _2$ and $\lambda _n$, but also, indirectly, on $\mu = \max _{2\le i \le n} |\lambda _i|$. The bounds are in terms of the diagonal entries of the group generalized inverse, $Q^{\#}$, of the singular and irreducible M-matrix $Q=\lambda _1 I-A$. Our starting point is a spectral resolution for $Q^{\#}$. We consider the case of equality in some of these inequalities and we apply our results to the algebraic connectivity of undirected graphs, where now $Q$ becomes $L$, the Laplacian of the graph. In case the graph is a tree we find a graph-theoretic interpretation for the entries of $L^{\#}$ and we also sharpen an upper bound on the algebraic connectivity of a tree, which is due to Fiedler and which involves only the diagonal entries of $L$, by exploiting the diagonal entries of $L^{\#}$.
In a recent paper the authors proposed a lower bound on $1 - \lambda _i$, where $\lambda _i$, $ \lambda _i \ne 1$, is an eigenvalue of a transition matrix $T$ of an ergodic Markov chain. The bound, which involved the group inverse of $I - T$, was derived from a more general bound, due to Bauer, Deutsch, and Stoer, on the eigenvalues of a stochastic matrix other than its constant row sum. Here we adapt the bound to give a lower bound on the algebraic connectivity of an undirected graph, but principally consider the case of equality in the bound when the graph is a weighted tree. It is shown that the bound is sharp only for certain Type I trees. Our proof involves characterizing the case of equality in an upper estimate for certain inner products due to A. Paz.