Abstract
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric (△, D) digraphs, that is large digraphs with a given maximum out-degree △ and diameter at most D. The digraphs are derived from a certain family of digraphs on alphabets, proposed by Faber and moore (1988), with new construction techniques that generalize previous result from conway and Guy (1982). With these families we have made important updates in the table of largest known vertex-symmetric (△, D) digraphs.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
