On the two largest Q-eigenvalues of graphs
From MaRDI portal
Publication:710585
DOI10.1016/J.DISC.2010.06.030zbMATH Open1208.05079OpenAlexW1996091767MaRDI QIDQ710585FDOQ710585
Authors: Francesco Belardo, B. Borovićanin, Jianfeng Wang, Qiongxiang Huang
Publication date: 19 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.030
Recommendations
- Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)
- On the extremal values of the second largest \(Q\)-eigenvalue
- Minimum values of the second largest \(Q\)-eigenvalue
- Bounds for the largest two eigenvalues of the signless Laplacian
- On the second largest eigenvalue of the signless Laplacian
cospectral graphslargest eigenvaluesignless Laplacianspectral characterizationfriendship graphgraph index
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Signless Laplacians of finite graphs
- A sharp upper bound of the spectral radius of graphs
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- Eigenvalue bounds for the signless laplacian
- On the second largest eigenvalue of line graphs
- Title not available (Why is that?)
- 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.
- Graph partitioning by eigenvectors
- Title not available (Why is that?)
- On graphs whose signless Laplacian index does not exceed 4.5
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The multi-fan graphs are determined by their Laplacian spectra
- The spectral radius of graphs on surfaces
- On the spectral characterizations of \(\infty \)-graphs
- Title not available (Why is that?)
- Bounds on the \(Q\)-spread of a graph
- Bounds on graph spectra
Cited In (38)
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- Signless Laplacian Spectral Radius and Some Hamiltonian Properties of Graphs
- Note on the subgraph component polynomial
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- On signed graphs whose second largest Laplacian eigenvalue does not exceed 3
- On the extremal values of the second largest \(Q\)-eigenvalue
- Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph
- Some bounds on the largest eigenvalues of graphs
- Distribution of signless Laplacian eigenvalues and graph invariants
- The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix
- The spectral determinations of connected multicone graphs \(K_{\mathcal{W}} \operatorname{\nabla} mCP(n)\)
- Spectral characterization of multicone graphs
- The spectral characterization of wind-wheel graphs
- On graphs with exactly three \(Q\)-eigenvalues at least two
- Signless Laplacian spectrum of a graph
- On the second largest eigenvalue of the signless Laplacian
- Title not available (Why is that?)
- Signless Laplacian spectral characterization of 4-rose graphs
- Spectral radii of friendship graphs and their connected induced subgraphs
- Minimum values of the second largest \(Q\)-eigenvalue
- The eccentricity spread of weak-friendship graphs
- A family of graphs that are determined by their normalized Laplacian spectra
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
- Signed graphs with all but two eigenvalues equal to \(\pm 1\)
- Signless Laplacian determinations of some graphs with independent edges
- The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9)
- Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)
- Connected graphs cospectral with a friendship graph
- Core-satellite graphs: clustering, assortativity and spectral properties
- Laplacian spectral determination of path-friendship graphs
- The spectral determinations of some classes of multicone graphs
- On the spectral determinations of the connected multicone graphs
- The spectral determination of the connected multicone graphs
- Spectral determination of graphs with one positive anti-adjacency eigenvalue
- THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- When local and global clustering of networks diverge
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
This page was built for publication: On the two largest \(Q\)-eigenvalues of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710585)