Laplacian spectral bounds for clique and independence numbers of graphs

DOI10.1016/J.JCTB.2006.12.003MaRDI QIDQ2642010zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clique numberLaplacian spectrumindependence number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 1833074 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• An always nontrivial upper bound for Laplacian graph eigenvalues
• Diameters and Eigenvalues
• Eigenvalue bounds for independent sets
• Interlacing eigenvalues and graphs
• Isoperimetric numbers of graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Spectral bounds for the clique and independence numbers of graphs
• The Laplacian Spectrum of a Graph II

Cited in

(27)

• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
• Vertex isoperimetry and independent set stability for tensor powers of cliques
• Graphs with small independence number minimizing the spectral radius
• A relative bound for independence
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• The spectral radius of graphs with given independence number
• The Laplacian spread of graphs.
• On the energy and spread of the adjacency, Laplacian and signless Laplacian matrices of graphs
• Spectral Bounds for the k-Regular Induced Subgraph Problem
• A unified combinatorial view beyond some spectral properties
• Toughness and normalized Laplacian eigenvalues of graphs
• Eigenvalue bounds for independent sets
• Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian
• More spectral bounds on the clique and independence numbers
• Spectral radius of digraphs with given dichromatic number
• A simpler characterization of a spectral lower bound on the clique number
• The \(A_{\alpha}\) spectral radius characterization of some digraphs
• Bounds for the Laplacian spectral radius of graphs
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• Graph toughness from Laplacian eigenvalues
• Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
• Dimension-free bounds and structural results in communication complexity
• The minimum spectral radius of graphs with a given independence number
• Some results on the bounds of signless Laplacian eigenvalues
• On the Aα-spectral radius of connected graphs
• The \(k\)-regular induced subgraph problem
• The maximum clique and the signless Laplacian eigenvalues

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)