Laplacian spectral bounds for clique and independence numbers of graphs
DOI10.1016/J.JCTB.2006.12.003zbMATH Open1122.05072OpenAlexW2030120460MaRDI QIDQ2642010FDOQ2642010
Authors: Mei Lu, Huiqing Liu, Feng Tian 
Publication date: 20 August 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.12.003
Recommendations
- Spectral bounds for the clique and independence numbers of graphs
- More spectral bounds on the clique and independence numbers
- Spectral bounds for the \(k\)-independence number of a graph
- Bounds on the (Laplacian) spectral radius of graphs
- Bounds for the Laplacian spectral radius of graphs
- Bounds for the Laplacian spectral radius of graphs
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on the independence number and signless Laplacian index of graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- An always nontrivial upper bound for Laplacian graph eigenvalues
- Title not available (Why is that?)
- The Laplacian Spectrum of a Graph II
- Title not available (Why is that?)
- Interlacing eigenvalues and graphs
- Eigenvalue bounds for independent sets
- Isoperimetric numbers of graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Title not available (Why is that?)
- Diameters and Eigenvalues
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- Spectral bounds for the clique and independence numbers of graphs
- Title not available (Why is that?)
Cited In (27)
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- A relative bound for independence
- Bounds on the spectral radius of general hypergraphs in terms of clique number
- Bounds for the Laplacian spectral radius of graphs
- Spectral radius of digraphs with given dichromatic number
- A simpler characterization of a spectral lower bound on the clique number
- Graph toughness from Laplacian eigenvalues
- Dimension-free bounds and structural results in communication complexity
- Eigenvalue bounds for independent sets
- More spectral bounds on the clique and independence numbers
- Some results on the bounds of signless Laplacian eigenvalues
- On the energy and spread of the adjacency, Laplacian and signless Laplacian matrices of graphs
- Vertex isoperimetry and independent set stability for tensor powers of cliques
- The spectral radius of graphs with given independence number
- The minimum spectral radius of graphs with a given independence number
- The \(k\)-regular induced subgraph problem
- Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian
- Graphs with small independence number minimizing the spectral radius
- Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
- The Laplacian spread of graphs.
- On the Aα-spectral radius of connected graphs
- A unified combinatorial view beyond some spectral properties
- The maximum clique and the signless Laplacian eigenvalues
- Spectral Bounds for the k-Regular Induced Subgraph Problem
- The \(A_{\alpha}\) spectral radius characterization of some digraphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Toughness and normalized Laplacian eigenvalues of graphs
This page was built for publication: Laplacian spectral bounds for clique and independence numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642010)
