Abstract
In 1995, Comellas and Fiol proposed a construction of record large vertex-transitive digraphs of given degree and diameter out of relatively small vertex-transitive input digraphs. We determine the automorphism group of the output digraph for a special but rather wide class of input digraphs.
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 callMore From: AKCE International Journal of Graphs and Combinatorics
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.
