Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1334
Title: | On the order of antipodal covers |
Authors: | Wang, Jianfeng Zhang, Wenqian Wang, Yiqiao Stanić, Zoran |
Keywords: | antipodal cover;diameter;distance-regular graph;fibre |
Issue Date: | 1-Feb-2024 |
Rank: | M22 |
Publisher: | Wiley |
Journal: | Journal of Graph Theory |
Abstract: | A 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. W... |
Description: | This 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 https://doi.org/10.1002/jgt.23037. This article may be used for non-commercial purposes in accordance ... |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1334 |
ISSN: | 03649024 |
DOI: | 10.1002/jgt.23037 |
Appears in Collections: | Research outputs |
Files in This Item:
File | Description | Size | Format | Existing users please |
---|---|---|---|---|
arcFINAL.pdf | 260.04 kB | Adobe PDF | Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.