The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices (Q2479513): Difference between revisions

Given a graph \(G\) on \(n\) vertices and its Laplacian matrix \(L\) with eigenvalues \(\lambda_n\geq\lambda_{n-1}\geq\dots\geq\lambda_1=0\), let \(L(v)\) be the \((n-1)\times(n-1)\) submatrix of \(L\) obtained by deleting the row and column of \(L\) corresponding to vertex \(v\) of \(G\). The spectral radius of \(L(v)\) satisfies \(\lambda_{n-1}\leq r(v)\leq\lambda_n\) for each \(v\). The author proved in [Linear Algebra Appl. 406, 253--271 (2005; Zbl 1070.05060)] that if \(G\) is a tree, then \(r(v)\neq\lambda_n\) for any vertex \(v\). Next, the set of trees was divided into type A trees as those for which there exists a vertex \(v\) such that \(r(v)=\lambda_{n-1}\), and the remaining, type B trees. It is shown here that this classification can be extended to graphs possessing cut vertices and the results of main theorems from above paper are generalized to this new setting.