Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/734
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:12Z-
dc.date.available2022-08-15T15:00:12Z-
dc.date.issued2020-01-01-
dc.identifier.issn00963003en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/734-
dc.description.abstractIn this paper we study connected signed graphs with 2 eigenvalues from several (theoretical and computational) perspectives. We give some basic results concerning the eigenvalues and cyclic structure of such signed graphs; in particular, we complete the list of those that are 3 or 4-regular. There is a natural relation between signed graphs and systems of lines in a Euclidean space that are pairwise orthogonal or at fixed angle, with a special role of those with 2 eigenvalues. In this context we derive a relative bound for the number of such lines (an extension of the similar bound related to unsigned graphs). We also determine all such graphs whose negative eigenvalue in not less than −2, except for so-called exceptional signed graphs. Using the computer search, we determine those with at most 10 vertices. Several constructions are given and the possible spectra of those with at most 30 vertices are listed.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofApplied Mathematics and Computationen_US
dc.subjectAdjacency matrixen_US
dc.subjectLine systemen_US
dc.subjectRegular signed graphen_US
dc.subjectSigned line graphen_US
dc.titleSpectra of signed graphs with two eigenvaluesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.amc.2019.124627-
dc.identifier.scopus2-s2.0-85070994289-
dc.identifier.isi000486392700002-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85070994289-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0096-3003en_US
dc.description.rankM21aen_US
dc.relation.firstpageArticle no. 124627en_US
dc.relation.volume364en_US
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

33
checked on Mar 30, 2025

Page view(s)

18
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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