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/737
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:13Z-
dc.date.available2022-08-15T15:00:13Z-
dc.date.issued2019-12-01-
dc.identifier.issn0166218Xen
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/737-
dc.description.abstractIn this paper we consider a concept of strong regularity of signed graphs—a generalization of strong regularity of graphs. We establish certain structural and spectral properties of such signed graphs and determine or characterize those belonging to specified classes. Theoretical results are followed by examples and discussions.en_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Applied Mathematicsen_US
dc.subjectAdjacency matrixen_US
dc.subjectBlock designen_US
dc.subjectEigenvaluesen_US
dc.subjectNet-degreeen_US
dc.subjectRegular signed graphen_US
dc.subjectWalks in a signed graphen_US
dc.titleOn strongly regular signed graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.dam.2019.06.017-
dc.identifier.scopus2-s2.0-85067970210-
dc.identifier.isi000500379100014-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85067970210-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0166-218Xen_US
dc.description.rankM22en_US
dc.relation.firstpage184en_US
dc.relation.lastpage190en_US
dc.relation.volume271en_US
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.fulltextNo Fulltext-
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

19
checked on Mar 31, 2025

Page view(s)

14
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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