The clique number and the smallest \(Q\)-eigenvalue of graphs

DOI10.1016/j.disc.2016.02.002zbMath1333.05192arXiv1508.01784OpenAlexW2216070917MaRDI QIDQ267202

Carla Oliveira, Vladimir Nikiforov, Leonardo Silva de Lima

Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.01784

zbMATH Keywords

Laplacianclique numbercomplete subgraphsextremal problemsignless Laplacianblow-up graphs

Mathematics Subject Classification ID

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

Related Items (11)

Merging the A-and Q-spectral theories ⋮ On a conjecture related to the smallest signless Laplacian eigenvalue of graphs ⋮ On the smallest eigenvalue of D_α-matrix of connected graphs ⋮ Note on the sum of the smallest and largest eigenvalues of a triangle-free graph ⋮ Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings ⋮ Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees ⋮ The Spectrum of Triangle-Free Graphs ⋮ The signless Laplacian spectral radius of graphs with a prescribed number of edges ⋮ On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree ⋮ On the least eigenvalue of \(A_\alpha \)-matrix of graphs ⋮ On the smallest signless Laplacian eigenvalue of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extrema of graph eigenvalues
• The smallest eigenvalue of the signless Laplacian
• How to make a graph bipartite
• Making a \(K_4\)-free graph bipartite
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• The local density of triangle-free graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Properties of spectra of graphs and line graphs
• A simple group of order 44,352,000
• Linear combinations of graph eigenvalues
• Eigenvalues of the Laplacian of a graph^∗

This page was built for publication: The clique number and the smallest \(Q\)-eigenvalue of graphs