1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/722
DC FieldValueLanguage
dc.contributor.authorRamezani, Farzanehen_US
dc.contributor.authorRowlinson, Peteren_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:11Z-
dc.date.available2022-08-15T15:00:11Z-
dc.date.issued2022-
dc.identifier.issn12343099en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/722-
dc.description.abstractWe consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-class association schemes.en_US
dc.relation.ispartofDiscussiones Mathematicae - Graph Theoryen_US
dc.subjectadjacency matrixen_US
dc.subjectassociation schemeen_US
dc.subjectsimple eigenvalueen_US
dc.subjectstrongly regular signed graphen_US
dc.subjectvertex-deleted subgraphen_US
dc.subjectweighing matrixen_US
dc.titleMore on Signed Graphs with at Most Three Eigenvaluesen_US
dc.typeArticleen_US
dc.identifier.doi10.7151/dmgt.2393-
dc.identifier.scopus2-s2.0-85102148304-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85102148304-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage1313en_US
dc.relation.lastpage1331en_US
dc.relation.volume42en_US
dc.relation.issue4en_US
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

7
checked on Nov 9, 2024

Page view(s)

43
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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