Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1365
DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2024-10-09T07:38:25Z-
dc.date.available2024-10-09T07:38:25Z-
dc.date.issued2025-01-01-
dc.identifier.issn03081087-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1365-
dc.description.abstractIn this paper, we consider relationships between net-regular, strongly regular and walk-regular signed graphs. There is no inclusion between any two of these classes, and we investigate conditions under which a signed graph is in the intersection of two or all three classes. In this context, we deduce which strongly regular signed graphs are net-regular, and we provide several sufficient conditions for a walk-regular signed graph to be net-regular or strongly regular, or both. It occurs that, in many situations, signed graphs belonging to at least two classes have a comparatively small number of distinct eigenvalues. Also, we investigate strongly regular signed graphs that induce, or are induced by, symmetric 2-class or 3-class association schemes. Many necessary and sufficient conditions are established, and in all results a limited number of distinct eigenvalues figures as one of them. Some problems that arose during the research are formulated.en_US
dc.language.isoenen_US
dc.publisherTaylor and Francisen_US
dc.relation.ispartofLinear and Multilinear Algebraen_US
dc.subjectassociation schemeen_US
dc.subjectnet regularityen_US
dc.subjectSigned graphen_US
dc.subjectspectrumen_US
dc.subjectstrong regularityen_US
dc.subjectwalk regularityen_US
dc.titleRelationships between net regularity, strong regularity and walk regularity of signed graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/03081087.2024.2405044-
dc.identifier.scopus2-s2.0-85205242639-
dc.identifier.isi001322341500001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85205242639-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0308-1087en_US
dc.description.rankM21en_US
dc.relation.firstpage1062en_US
dc.relation.lastpage1077en_US
dc.relation.volume73en_US
dc.relation.issue6en_US
item.cerifentitytypePublications-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

2
checked on Jun 9, 2026

Page view(s)

19
checked on Jun 12, 2026

Google ScholarTM

Check

Altmetric

Altmetric


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