AbstractWe give bounds for the second real eigenvalue of nonegative matrices and Z-matrices. Furthermore, we establish upper bounds for the maximal spectral radii of principal submatrices of nonnegative matrices. Using these bounds, we prove that our inequality for the second real eigenvalue of the adjacency matrix of a connected regular graph improves a well-known bound for the second eigenvalue using Cheeger's inequality
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix fo...
AbstractSpectral bounds are obtained for a type of Z-matrix using Perron-Frobenius theory on the inv...
AbstractWe give a lower bound for the second smallest eigenvalue of Laplacian matrices in terms of t...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractSpectral bounds are obtained for a type of Z-matrix using Perron-Frobenius theory on the inv...
Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix fo...
AbstractSpectral bounds are obtained for a type of Z-matrix using Perron-Frobenius theory on the inv...
AbstractWe give a lower bound for the second smallest eigenvalue of Laplacian matrices in terms of t...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractSpectral bounds are obtained for a type of Z-matrix using Perron-Frobenius theory on the inv...
Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix fo...
AbstractSpectral bounds are obtained for a type of Z-matrix using Perron-Frobenius theory on the inv...