Connected claw-free graphs whose second largest eigenvalue does not exceed 1

Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/3204

Title:	Connected claw-free graphs whose second largest eigenvalue does not exceed 1
Authors:	Chen, Chaochui Shan, Haiying Liu, Muhuo Stanić, Zoran
Affiliations:	Numerical Mathematics and Optimization
Keywords:	Complementary graph;Forbidden induced subgraph;Graph spectrum;Second largest eigenvalue
Issue Date:	1-Aug-2026
Rank:	M21
Publisher:	Elsevier
Journal:	Discrete Mathematics
Abstract:	By extending the main result of [European J. Combin., 97 (2021), 103385], we determine all connected claw-free graphs whose second largest eigenvalue does not exceed 1, where a claw is the star K1,3. In contrast to the existing results on graphs with the same spectral property, our approach introduces a technique that systematically analyses complementary graphs of graphs under consideration.
URI:	https://research.matf.bg.ac.rs/handle/123456789/3204
ISSN:	0012365X
DOI:	10.1016/j.disc.2026.115079
Appears in Collections:	Research outputs

1

checked on Jun 10, 2026

10

checked on Jun 12, 2026

Check