A spectral proof of the uniqueness of a strongly regular graph with parameters (81, 20, 1, 6)

DC Field	Value	Language
dc.contributor.author	Stevanović, Dragan	en
dc.contributor.author	Milošević, Marko	en
dc.date.accessioned	2020-05-01T20:13:03Z	-
dc.date.available	2020-05-01T20:13:03Z	-
dc.date.issued	2009-05-01	en
dc.identifier.issn	0195-6698	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1287	-
dc.description.abstract	We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6). Unlike the finite geometry approach used by Brouwer and Haemers, we use linear algebra and spectral graph theory concepts, namely the technique of star complements, in our proof.	en
dc.publisher	Elsevier	-
dc.relation	Slovenian Agency for Research, program P1-0285	-
dc.relation	Serbian Ministry of Science, grant 144026	-
dc.relation.ispartof	European Journal of Combinatorics	en
dc.title	A spectral proof of the uniqueness of a strongly regular graph with parameters (81, 20, 1, 6)	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.ejc.2008.07.021	en
dc.identifier.scopus	2-s2.0-61449182643	en
dc.relation.firstpage	957	en
dc.relation.lastpage	968	en
dc.relation.issue	4	en
dc.relation.volume	30	en
dc.description.rank	M21	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
crisitem.author.orcid	0000-0003-2908-305X	-

10

checked on Mar 30, 2026

103

checked on Mar 30, 2026

Check