Abstract
AbstractA noncomplete graph of diameter is called an antipodal ‐cover if its vertex set can be partitioned into the subsets (also called fibres) of vertices each, in such a way that two vertices of are at distance if and only if they belong to the same fibre. We say that is symmetric if for every , there exist such that , where . In this paper, we prove that, for , an antipodal ‐cover which is not a cycle, has at least vertices provided , and at least vertices provided it is symmetric. Our results extend those of Göbel and Veldman.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
