Cycle prefix digraphs for symmetric interconnection networks

DOI10.1002/net.3230230707zbMath0802.90043OpenAlexW2045311102MaRDI QIDQ3141771

Vance Faber, James W. Moore, William Y. C. Chen

Publication date: 1 November 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230707

zbMATH Keywords

large graphsCayley digraphsshortest-path routinghighly symmetric interconnection networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (18)

Asymptotically approaching the Moore bound for diameter three by Cayley graphs ⋮ Connectivities of minimal Cayley coset digraphs ⋮ IEH graphs. A novel generalization of hypercube graphs ⋮ Large Cayley digraphs and bipartite Cayley digraphs of odd diameters ⋮ Digraphs on permutations ⋮ Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups ⋮ Broadcasting in cycle prefix digraphs ⋮ Uni-directional alternating group graphs ⋮ THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY ⋮ Weakly distance-regular digraphs. ⋮ Large Cayley digraphs of given degree and diameter ⋮ Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter ⋮ Which Faber-Moore-Chen digraphs are Cayley digraphs? ⋮ Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter ⋮ On large vertex-symmetric digraphs ⋮ A new general family of mixed graphs ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks ⋮ Large vertex-transitive and Cayley graphs with given degree and diameter

Cites Work

• SPECIAL ISSUE ON INTERCONNECTION NETWORKS-EDITORS' FOREWORD

This page was built for publication: Cycle prefix digraphs for symmetric interconnection networks