Inequalities for Graph Eigenvalues

DOI10.1017/CBO9781316341308zbMath1368.05001OpenAlexW4229629829MaRDI QIDQ5251749

Zoran Stanić

Publication date: 21 May 2015

Full work available at URL: https://doi.org/10.1017/cbo9781316341308

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)

Related Items (48)

Some upper bounds for the net Laplacian index of a signed graph ⋮ Ordering signed graphs with large index ⋮ Unbalanced signed graphs with extremal spectral radius or index ⋮ Ordering graphs by their largest (least) A_α-eigenvalues ⋮ Dynamical systems on graphs through the signless Laplacian matrix ⋮ The many facets of the Estrada indices of graphs and networks ⋮ On the second largest eigenvalue of some Cayley graphs of the symmetric group ⋮ Trees with small spectral gap ⋮ Some properties of the eigenvalues of the net Laplacian matrix of a signed graph ⋮ Perturbations in a signed graph and its index ⋮ Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size ⋮ Controllability of NEPSes of graphs ⋮ Walks and eigenvalues of signed graphs ⋮ Bounding the largest eigenvalue of signed graphs ⋮ Maximum spread of graphs and bipartite graphs ⋮ Signed graphs whose all Laplacian eigenvalues are main ⋮ On the \(\alpha\)-index of minimally 2-connected graphs with given order or size ⋮ Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size ⋮ Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph ⋮ Strong star complements in graphs ⋮ The first eigenvector of a distance matrix is nearly constant ⋮ Determination of particular double starlike trees by the Laplacian spectrum ⋮ Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions ⋮ Maximum spread of \(K_{2,t}\)-minor-free graphs ⋮ Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size ⋮ Limit points for the spectral radii of signed graphs ⋮ Upper bounds of spectral radius of symmetric matrices and graphs ⋮ Connected signed graphs of fixed order, size, and number of negative edges with maximal index ⋮ Characterization of outerplanar graphs whose second largest eigenvalue is at most 1 ⋮ Laplacian controllability for graphs with integral Laplacian spectrum ⋮ Main eigenvalues of real symmetric matrices with application to signed graphs ⋮ On cardinality of complementarity spectra of connected graphs ⋮ Unnamed Item ⋮ Some spectral properties of the non-backtracking matrix of a graph ⋮ Upper bounds for the largest singular value of certain digraph matrices ⋮ Sharp bounds for spectral radius of nonnegative weakly irreducible tensors ⋮ On graphs whose second largest eigenvalue is at most 1 ⋮ A note on the eigenvalue free intervals of some classes of signed threshold graphs ⋮ The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs ⋮ Ordering graphs with given size by their signless Laplacian spectral radii ⋮ Eigenvalue bounds for some classes of matrices associated with graphs ⋮ Eigenvalue-free intervals of distance matrices of threshold and chain graphs ⋮ An upper bound for the Laplacian index of a signed graph ⋮ A_α-spectral radius and measures of graph irregularity ⋮ A complete characterization of graphs with exactly two positive eigenvalues ⋮ Hermitian adjacency matrix of the second kind for mixed graphs

This page was built for publication: Inequalities for Graph Eigenvalues