Inequalities for Graph Eigenvalues
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4043884
- Properties of spectra of graphs and line graphs
- Some new bounds on the spectral radius of graphs
- On a conjecture of V. Nikiforov
- Inequalities on vertex degrees, eigenvalues and (signless) Laplacian eigenvalues of graphs
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- The spectral radius of subgraphs of regular graphs
- The largest eigenvalue of a graph: A survey
- Bounds of eigenvalues of a graph
- A note on \(\lambda_2\) and \(\lambda_n\) of a graph
Cited in
(79)- Dynamical systems on graphs through the signless Laplacian matrix
- Perturbations in a signed graph and its index
- Some spectral properties of the non-backtracking matrix of a graph
- Upper bounds for the largest singular value of certain digraph matrices
- On graphs whose second largest eigenvalue is at most 1
- 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
- A complete characterization of graphs with exactly two positive eigenvalues
- Hermitian adjacency matrix of the second kind for mixed graphs
- Some upper bounds for the net Laplacian index of a signed graph
- Unbalanced signed graphs with extremal spectral radius or index
- The many facets of the Estrada indices of graphs and networks
- On the second largest eigenvalue of some Cayley graphs of the symmetric group
- Some properties of the eigenvalues of the net Laplacian matrix of a signed graph
- 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
- Laplacian controllability for graphs with integral Laplacian spectrum
- On cardinality of complementarity spectra of connected graphs
- Sharp bounds for spectral radius of nonnegative weakly irreducible tensors
- A note on the eigenvalue free intervals of some classes of signed threshold graphs
- Bounding the largest eigenvalue of signed graphs
- The first eigenvector of a distance matrix is nearly constant
- Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
- Some Inequalities for the Largest Eigenvalue of a Graph
- Trees with small spectral gap
- Note on Graphs and Matrix Inequalities
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Eigenvalue-free intervals of distance matrices of threshold and chain graphs
- Ordering signed graphs with large index
- Bounds on the \(A_\alpha\)-spectral radius of a \(C_3\)-free graph
- Controllability of NEPSes of graphs
- Locating eigenvalues in graphs. Algorithms and applications
- Main eigenvalues of real symmetric matrices with application to signed graphs
- Solvability of Graph Inequalities
- Eigenvalue bounds for some classes of matrices associated with graphs
- An upper bound for the Laplacian index of a signed graph
- Aα-spectral radius and measures of graph irregularity
- Ordering graphs by their largest (least) Aα-eigenvalues
- Walks and eigenvalues 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
- 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_ -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
- A note on the signless Laplacian spectral ordering of graphs with given size
- The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
- Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
- On the maximum spread of planar and outerplanar graphs
- Maxima of the A_-spectral radius of graphs with given size and minimum degree 2
- Unifying adjacency, Laplacian, and signless Laplacian theories
- Laplacian eigenvalues and eigenspaces of cographs generated by finite sequence
- Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
- Variable neighbourhood search for connected graphs of fixed order and size with minimal spectral radius
- What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion
- On the second largest adjacency eigenvalue of trees with given diameter
- An upper bound for the largest singular value of extended mixed graphs
- Determining some graph joins by the signless Laplacian spectrum
- An ordering theorem on the Q-spectral radius of graphs with given size and its applications
- Bounds and extremal graphs for the energy of complex unit gain graphs
- On regular graphs with a tree of diameter 3 as a star complement
- Employing star complements in search for graphs with fixed rank
- Graphs with large clique number whose second largest eigenvalue does not exceed \((\sqrt{5}-1)/2\)
- Quantum-like states on complex synchronized networks
- On the maximum second eigenvalue of outerplanar graphs
- Two classes of graphs determined by the signless Laplacian spectrum
- Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
- Maximum spread of \(K_{s,t}\)-minor-free graphs
- Connected claw-free graphs whose second largest eigenvalue does not exceed 1
- Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
- On K₄-minor free graphs whose second largest eigenvalue does not exceed 1
- Proof of a conjectured spectral upper bound on the chromatic number of a graph
This page was built for publication: Inequalities for Graph Eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251749)
