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_US
dc.language.isoenen_US
dc.publisherTaylor and Francisen_US
dc.relation.ispartofLinear and Multilinear Algebraen_US
dc.subject05C50en_US
dc.subject05C51en_US
dc.subject65F15en_US
dc.subjectAdjacency matrixen_US
dc.subjectSebastian Cioabaen_US
dc.subjectstar complementen_US
dc.subjectstrongly regular graphen_US
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.isi000586985300005-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85062802102-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0308-1087en_US
dc.description.rankM21en_US
dc.relation.firstpage2448en_US
dc.relation.lastpage2461en_US
dc.relation.volume68en_US
dc.relation.issue12en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.languageiso639-1en-
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

2
checked on Jun 12, 2025

Page view(s)

8
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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