Eigenvalue bounds for some classes of matrices associated with graphs.

Autor:	Mehatari, Ranjit
Další autoři:	Kannan, M. Rajesh
Jazyk:	angličtina
Předmět:	matematika mathematics články journal articles Randić index adjacency matrix Laplacian matrix normalized adjacency matrix spectral radius algebraic connectivity
Druh dokumentu:	Non-fiction
ISSN:	0011-4642
Abstrakt:	Abstract: For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first, we derive bounds for the second largest and the smallest eigenvalues of adjacency matrices of $k$-regular graphs. Then we establish some bounds for the second largest and the smallest eigenvalues of the normalized adjacency matrices of graphs and the second smallest and the largest eigenvalues of the Laplacian matrices of graphs. The sharpness of these bounds is verified by examples.
Databáze:	Katalog Knihovny AV ČR
Externí odkaz:	Plný text Plný text Full text from SpringerLink