A (forgotten) upper bound for the spectral radius of a graph

DOI10.11650/TJM.19.2015.5393MaRDI QIDQ514952zbMATH OpenOpenAlexFDO

Authors Clive Elphick, Chia-An Liu

Publication date 9 March 2017

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graphspectral radiusclique numberQ-index

Mathematics Subject Classification ID

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

Abstract: The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating from 1983 is equivalent to their much more recent bound. This bound is then used to compare lower bounds for the clique number. A series of sharp upper bounds for the signless Laplacian spectral radius is then proposed as another application. Finally a new lower bound for generalised r-partite graphs is proved, by extending a result due to Erdos.

Recommendations

• Maxima of the \(Q\)-index: graphs with bounded clique number
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• scientific article; zbMATH DE number 1877024
• Some sharp upper bounds on the spectral radius of graphs
• Sharp bounds on the spectral radius and the energy of graphs

Cited in

(1)

• On an upper bound of the spectral radius of graphs

This page was built for publication: A (forgotten) upper bound for the spectral radius of a graph

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