Abstract
Cycle prefix digraphs comprise a class of vertex symmetric digraphs with many interesting properties, such as large order for a given degree and diameter, Hamiltonicity, and hierarchical structure. From their known structural properties, we determine the spectra of the digraphs. We also show that, although cycle prefix digraphs are not distance regular according to the usual definition, they have properties that fully characterize, in the undirected case, distance regular graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.