Some bounds on the largest eigenvalues of graphs
From MaRDI portal
Publication:427601
DOI10.1016/J.AML.2011.09.009zbMATH Open1243.05152OpenAlexW1984754547MaRDI QIDQ427601FDOQ427601
Authors: Shuchao Li, Yi Tian
Publication date: 14 June 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.009
Recommendations
- Bounds for the largest two eigenvalues of the signless Laplacian
- Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
- Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
- New upper bound on the largest Laplacian eigenvalue of graphs
- The upper bounds for the largest Laplacian eigenvalue of graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Determinants, permanents, traces, other special matrix functions (15A15)
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Title not available (Why is that?)
- Signless Laplacians of finite graphs
- Eigenvalues of the Laplacian of a graph∗
- Which graphs are determined by their spectrum?
- Eigenvalue bounds for the signless laplacian
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Bounds on the (Laplacian) spectral radius of graphs
- On the Laplacian spectral radius of a graph
- A bound on the spectral radius of graphs
- On the two largest \(Q\)-eigenvalues of graphs
- Eigenvectors of acyclic matrices
- Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
- The largest eigenvalue of nonregular graphs
- A bound on the spectral radius of graphs with \(e\) edges
Cited In (18)
- Upper bounds on the (signless) Laplacian eigenvalues of graphs
- A quantum searching model finding one of the edges of a subgraph in a complete graph
- Title not available (Why is that?)
- Upper bounds for the largest singular value of certain digraph matrices
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Bounds on the greatest eigenvalue of graphs.
- Bounds for the largest two eigenvalues of the signless Laplacian
- Eigenvalues and forbidden subgraphs. I.
- A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues
- Bounds for the largest \(p\)-Laplacian eigenvalue for graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some results on the largest and least eigenvalues of graphs
- Title not available (Why is that?)
- Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
- Eigenvalue bounds for some classes of matrices associated with graphs
- Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
- Bounding the sum of the largest signless Laplacian eigenvalues of a graph
- New upper bound on the largest Laplacian eigenvalue of graphs
This page was built for publication: Some bounds on the largest eigenvalues of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427601)