Remarks on graphs with majority of eigenvalues at most -1

DC Field	Value	Language
dc.contributor.author	Stevanović, Dragan	en
dc.date.accessioned	2020-05-01T20:13:06Z	-
dc.date.available	2020-05-01T20:13:06Z	-
dc.date.issued	2003-07-01	en
dc.identifier.issn	0024-3795	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1309	-
dc.description.abstract	We give examples of graphs the majority of whose eigenvalues are at most -1, thus disproving a conjecture of Yong (Linear Algebra Appl. 295 (1999) 73).	en
dc.publisher	Elsevier	-
dc.relation	Serbian Ministry of Science, Technology and Development, Grant 1389	-
dc.relation.ispartof	Linear Algebra and Its Applications	en
dc.subject	Conjecture \| Eigenvalues of graphs \| Multiplicity of eigenvalues	en
dc.title	Remarks on graphs with majority of eigenvalues at most -1	en
dc.type	Article	en
dc.identifier.doi	10.1016/S0024-3795(02)00652-3	en
dc.identifier.scopus	2-s2.0-0038396125	en
dc.relation.firstpage	337	en
dc.relation.lastpage	340	en
dc.relation.volume	367	en
dc.description.rank	M22	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
crisitem.author.orcid	0000-0003-2908-305X	-

1

checked on Apr 2, 2025

19

checked on Jan 31, 2025

Check