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/697
DC FieldValueLanguage
dc.contributor.authorAndelić, Milicaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:08Z-
dc.date.available2022-08-15T15:00:08Z-
dc.date.issued2020-05-01-
dc.identifier.issn12343099en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/697-
dc.description.abstractIn this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular. We also give some constructions and determine all the signed graphs with 3 eigenvalues, under the constraint that they are either signed line graphs or have vertex degree 3. We also report our result of computer search on those with at most 10 vertices.en_US
dc.language.isoenen_US
dc.relation.ispartofDiscussiones Mathematicae - Graph Theoryen_US
dc.subjectAdjacency matrixen_US
dc.subjectblock designen_US
dc.subjecteigenvalueen_US
dc.subjectregular signed graphen_US
dc.subjectsigned line graphen_US
dc.titleOn Regular Signed Graphs with Three Eigenvaluesen_US
dc.typeArticleen_US
dc.identifier.doi10.7151/dmgt.2279-
dc.identifier.scopus2-s2.0-85083581673-
dc.identifier.isi000508662500005-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85083581673-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn1234-3099en_US
dc.description.rankM22en_US
dc.relation.firstpage405en_US
dc.relation.lastpage416en_US
dc.relation.volume40en_US
dc.relation.issue2en_US
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
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

9
checked on Mar 31, 2025

Page view(s)

13
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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