Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/711
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:10Z-
dc.date.available2022-08-15T15:00:10Z-
dc.date.issued2020-01-01-
dc.identifier.issn03545180en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/711-
dc.description.abstractIn this study we consider connected signed graphs with 2 eigenvalues that admit a vertex set partition such that the induced signed graphs also have 2 eigenvalues, each. We derive some spectral characterizations, along with examples supported by additional theoretical results. We also prove an inequality that is a fundamental ingredient for the resolution of the Sensitivity Conjecture.en
dc.relation.ispartofFilomaten
dc.subjectExceptional signed graphen
dc.subjectSigned graph decompositionen
dc.subjectSigned line graphen
dc.subjectSpectrum of the adjacency matrixen
dc.subjectStar complementsen
dc.titleA decomposition of signed graphs with two eigenvaluesen_US
dc.typeArticleen_US
dc.identifier.doi10.2298/FIL2006949S-
dc.identifier.scopus2-s2.0-85085361893-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85085361893-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage1949en
dc.relation.lastpage1957en
dc.relation.volume34en
dc.relation.issue6en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
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

10
checked on Nov 14, 2024

Page view(s)

8
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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