On graphs whose second largest eigenvalue does not exceed (√5-1) 2

DC Field	Value	Language
dc.contributor.author	Cvetković, Dragoš	en
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:52Z	-
dc.date.available	2020-05-01T20:12:52Z	-
dc.date.issued	1995-03-06	en
dc.identifier.issn	0012-365X	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1187	-
dc.description.abstract	It is well known in the theory of graph spectra that connected graphs except for complete multipartite (including complete) graphs have the second largest eigenvalue greater than 0. Graphs whose second largest eigenvalue does not exceed 1 3 are characterized in Cao and Yuan (1993). In this paper we study the structure of graphs whose second largest eigenvalue does not exceed (√5-1) 2.	en
dc.publisher	Elsevier	-
dc.relation.ispartof	Discrete Mathematics	en
dc.subject	Forbidden subgraphs \| Graph spectra \| Hereditary properties \| Join of graphs \| Second largest eigenvalue	en
dc.title	On graphs whose second largest eigenvalue does not exceed (√5-1) 2	en
dc.type	Article	en
dc.identifier.doi	10.1016/0012-365X(94)00204-V	en
dc.identifier.scopus	2-s2.0-0142171299	en
dc.relation.firstpage	213	en
dc.relation.lastpage	227	en
dc.relation.issue	1-3	en
dc.relation.volume	138	en
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-

24

checked on Apr 17, 2024

22

checked on Apr 16, 2024

Check