Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/714
DC FieldValueLanguage
dc.contributor.authorRamezani, Farzanehen_US
dc.contributor.authorRowlinson, Peteren_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:10Z-
dc.date.available2022-08-15T15:00:10Z-
dc.date.issued2022-
dc.identifier.issn00114642en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/714-
dc.description.abstractWe investigate signed graphs with just 2 or 3 distinct eigenvalues, mostly in the context of vertex-deleted subgraphs, the join of two signed graphs or association schemes.en
dc.relation.ispartofCzechoslovak Mathematical Journalen
dc.subject05C22en
dc.subject05C50en
dc.subjectadjacency matrixen
dc.subjectassociation schemeen
dc.subjectjoinen
dc.subjectmain eigenvalueen
dc.subjectnet-degreeen
dc.subjectsigned graphen
dc.titleSigned graphs with at most three eigenvaluesen_US
dc.typeArticleen_US
dc.identifier.doi10.21136/CMJ.2021.0256-20-
dc.identifier.scopus2-s2.0-85104233419-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85104233419-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage59en
dc.relation.lastpage77en
dc.relation.volume72en
dc.relation.issue1en
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

4
checked on Nov 15, 2024

Page view(s)

7
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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