Maxima of the Q-index: graphs with bounded clique number

MaRDI QIDQ5746791zbMATH OpenFDO

Authors Vladimir Nikiforov, Nair Abreu

Publication date 10 February 2014

Full work available at URL https://arxiv.org/abs/1308.1653, http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol26_pp121-130.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

cliqueclique numbereigenvalue boundssignless Laplacianspectral radius

Mathematics Subject Classification ID

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

Abstract: This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of given order and clique number. More precisely, let G be a graph of order n, let A be its adjacency matrix, and let D be the diagonal matrix of the row-sums of A. If G has clique number r, then the largest eigenvalue q(G) of the matrix Q=A+D satisfies q(G)<= 2(1-1/r)n. If G is a complete regular r-partite graph, then equality holds in the above inequality. This result confirms a conjecture of Hansen and Lucas.

Recommendations

• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• The maximum clique and the signless Laplacian eigenvalues
• Maxima of the Q-index: abstract graph properties
• Bounds on the distance signless Laplacian spectral radius in terms of clique number

Cited in

(29)

• Spectral bounds for the clique and independence numbers of graphs
• The maximum number of 3- and 4-cliques within a planar maximally filtered graph
• The complete list of maximal cliques of Quad\((n,q)\), \(q\) odd
• Maxima of the \(Q\)-index: forbidden a Fan
• Maximize the \(Q\)-index of graphs with fixed order and size
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
• The clique number and the smallest \(Q\)-eigenvalue of graphs
• Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs.
• An asymptotically tight bound on the q-index of graphs with forbidden cycles
• Extremal Halin graphs with respect to the signless Laplacian spectra
• A generalization for the clique and independence numbers
• Maxima of the Q-index: abstract graph properties
• The maximum clique and the signless Laplacian eigenvalues
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Upper bounds on Q-spectral radius of book-free and/or \(K_{s,t}\)-free graphs
• On the signless Laplacian spectra of \(k\)-trees
• Merging the \(A\)- and \(Q\)-spectral theories
• A (forgotten) upper bound for the spectral radius of a graph
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph
• The \(Q\)-index: degenerate graphs
• Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
• The signless Laplacian spectral Turán problems for color-critical graphs
• Some further bounds for the \(Q\)-index of nested split graphs
• A signless Laplacian spectral Erdős-Stone-Simonovits theorem
• Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
• A result on spanning trees with bounded total excess
• Some Turán-type results for the signless Laplacian spectral radius
• Maximal Q-index: graphs without long wheels

This page was built for publication: Maxima of the \(Q\)-index: graphs with bounded clique number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746791)