Reliable circulant networks with minimum transmission delay

It is well known that maximum connectivity graphs play an important role in the design of reliable networks. The class of symmetric graphs called circulants is known to contain such maximum connectivity graphs. Although not all circulants have this maximum connectivity property, those that do have a great variation in their diameters. Since diameter is a measure of transmission delay, the minimum diameter, maximum connectivity circulant problem is considered here. Several results are given for the general case and a simple solution is derived for the connectivity four case.

[1]  Kenneth Steiglitz,et al.  The Design of Small-Diameter Networks by Local Search , 1979, IEEE Transactions on Computers.

[2]  Lou Caccetta,et al.  On diameter critical graphs , 1979, Discret. Math..

[3]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[4]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[5]  S. Louis Hakimi,et al.  Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.

[6]  Louis Caccetta.  ON EXTREMAL GRAPHS WITH GIVEN DIAMETER AND CONNECTIVITY , 1979 .

[7]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

[8]  F. Boesch,et al.  On graphs of invulnerable communication nets , 1970 .

[9]  Gérard Memmi,et al.  Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.

[10]  B. Bollobás.  A problem of the theory of communication networks , 1968 .

[11]  F. Boesch,et al.  Super line-connectivity properties of circulant graphs , 1986 .

[12]  B. R. Myers.  Regular separable graphs of minimum order with given diameter , 1981, Discret. Math..

[13]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[14]  Francis T. Boesch,et al.  A general class of invulnerable graphs , 1972, Networks.

[15]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.

[16]  B. Myers.  The minimum-order three-connected cubic graphs with specified diameters , 1980 .

[17]  S. Hakimi.  An Algorithm for Construction of the Least Vulnerable Communication Network or the Graph with the Maximum Connectivity , 1969 .

[18]  S. Louis Hakimi,et al.  On the design of reliable networks , 1973, Networks.

[19]  F. Harary.  THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.