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/1334
DC FieldValueLanguage
dc.contributor.authorWang, Jianfengen_US
dc.contributor.authorZhang, Wenqianen_US
dc.contributor.authorWang, Yiqiaoen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2024-08-16T07:55:12Z-
dc.date.available2024-08-16T07:55:12Z-
dc.date.issued2024-02-01-
dc.identifier.issn03649024-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1334-
dc.descriptionThis is the peer reviewed version of the following article: J. Wang, W. Zhang, Y. Wang and Z. Stanić, On the order of antipodal covers, J. Graph Theory. 2024; 105: 285–296. https://doi.org/10.1002/jgt.23037, which has been published in final form at <a href="https://doi.org/10.1002/jgt.23037">https://doi.org/10.1002/jgt.23037</a>. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited.en_US
dc.description.abstractA noncomplete graph (Formula presented.) of diameter (Formula presented.) is called an antipodal (Formula presented.) -cover if its vertex set can be partitioned into the subsets (also called fibres) (Formula presented.) of (Formula presented.) vertices each, in such a way that two vertices of (Formula presented.) are at distance (Formula presented.) if and only if they belong to the same fibre. We say that (Formula presented.) is symmetric if for every (Formula presented.), there exist (Formula presented.) such that (Formula presented.), where (Formula presented.). In this paper, we prove that, for (Formula presented.), an antipodal (Formula presented.) -cover which is not a cycle, has at least (Formula presented.) vertices provided (Formula presented.), and at least (Formula presented.) vertices provided it is symmetric. Our results extend those of Göbel and Veldman.en_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofJournal of Graph Theoryen_US
dc.subjectantipodal coveren_US
dc.subjectdiameteren_US
dc.subjectdistance-regular graphen_US
dc.subjectfibreen_US
dc.titleOn the order of antipodal coversen_US
dc.typeArticleen_US
dc.identifier.doi10.1002/jgt.23037-
dc.identifier.scopus2-s2.0-85173430502-
dc.identifier.isi001075448300001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85173430502-
dc.relation.issn0364-9024en_US
dc.description.rankM22en_US
dc.relation.firstpage285en_US
dc.relation.lastpage296en_US
dc.relation.volume105en_US
dc.relation.issue2en_US
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.openairetypeArticle-
item.grantfulltextrestricted-
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
Files in This Item:
File Description SizeFormat Existing users please
arcFINAL.pdf260.04 kBAdobe PDF
    Request a copy
Show simple item record

Page view(s)

24
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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