Small Diameter Symmetric Networks From Linear Groups

Authors:
Lowell Campbell;Gunnar E. Carlsson;Michael J. Dinneen;Vance Faber;Michael R. Fellows;Michael A. Langston;James W. Moore;Andrew P. Mullhaupt;Harlan B. Sexton
Affiliations:
-;-;-;-;-;-;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 3
Cited 2

Interconnection Networks Based on a Generalization of Cube-Connected Cycles

IEEE Transactions on Computers
On group graphs and their fault tolerance

IEEE Transactions on Computers
Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing

Optimal Layouts of Midimew Networks

IEEE Transactions on Parallel and Distributed Systems
Largest graphs of diameter 2 and maximum degree 6

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	14.98

Visualization

Abstract

A report is presented on a collection of constructions of symmetric networks that provide the largest known values for the number of nodes that can be placed in a network of a given degree and diameter. Some of the constructions are in the range of current potential engineering significance. The constructions are Cayley graphs of linear groups obtained by experimental computation.