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/718
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:11Z-
dc.date.available2022-08-15T15:00:11Z-
dc.date.issued2020-12-01-
dc.identifier.issn03081087en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/718-
dc.description.abstractIn this paper we consider strongly regular graphs G which admit a decomposition into two strongly regular graphs such that one of them, say H, is a star complement of G. Relations between the parameters of graphs paired in this way are determined. We also consider several particular types of strongly regular graph and determine whether such graphs can appear in the role of G or H.en
dc.relation.ispartofLinear and Multilinear Algebraen
dc.subject05C50en
dc.subject05C51en
dc.subject65F15en
dc.subjectAdjacency matrixen
dc.subjectSebastian Cioabaen
dc.subjectstar complementen
dc.subjectstrongly regular graphen
dc.titleStar complementary strongly regular decompositions of strongly regular graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/03081087.2019.1586821-
dc.identifier.scopus2-s2.0-85062802102-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85062802102-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage2448en
dc.relation.lastpage2461en
dc.relation.volume68en
dc.relation.issue12en
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

1
checked on Nov 15, 2024

Page view(s)

8
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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