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

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 ω, then the largest eigenvalue q (G) of the matrix Q = A+ D satisfies q(G)≤ 2(1- 1/ω)n. If G is a complete regular ω-partite graph, then equality holds in the above inequality.

References Powered by Scopus

Eigenvalues of the Laplacian of a Graph

404Citations
N/AReaders
Get full text

Spectral bounds for the clique and independence numbers of graphs

130Citations
N/AReaders
Get full text

Sharp bounds for the signless Laplacian spectral radius in terms of clique number

42Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Merging the A- and Q-spectral theories

222Citations
N/AReaders
Get full text

Inequalities for graph eigenvalues

63Citations
N/AReaders
Get full text

Bounds on the distance signless Laplacian spectral radius in terms of clique number

32Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

de Abreu, N. M. M., & Nikiforov, V. (2013). Maxima of the Q-index: Graphs with bounded clique number. Electronic Journal of Linear Algebra, 26, 121–130. https://doi.org/10.13001/1081-3810.1643

Readers' Seniority

Tooltip

Professor / Associate Prof. 1

25%

Lecturer / Post doc 1

25%

PhD / Post grad / Masters / Doc 1

25%

Researcher 1

25%

Readers' Discipline

Tooltip

Mathematics 3

75%

Agricultural and Biological Sciences 1

25%

Save time finding and organizing research with Mendeley

Sign up for free