Please use this identifier to cite or link to this item:
Title: Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
Author: Cardoso, Domingos M.
Costa, Inês Serôdio
Duarte, Rui
Keywords: Least eigenvalue of a graph
Edge clique partition
n-Queens graph
Issue Date: Aug-2023
Publisher: Springer
Abstract: Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove that the least eigenvalue of the n-Queens graph Q(n) is equal to −4 for every n ≥ 4 and it is also proven that the multiplicity of this eigenvalue is (n−3)^2. Finally, edge clique partitions of additional infinite families of connected graphs and their relations with the least eigenvalues are presented.
Peer review: yes
DOI: 10.1007/s10801-023-01247-1
ISSN: 0925-9899
Publisher Version:
Appears in Collections:CIDMA - Artigos
DMat - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
LeastEigenvalueGraphDeterminedEdgeCliquePartition.pdf513.26 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.