Vertex-symmetric generalized Moore graphs

Discrete Applied Mathematics

Volumn 138, Issue 1-2, 2004, Pages 195-202

  Sampels, Michael ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Cayley graphs; Degree diameter problem; Mean distance; Moore bound; Transmission

Indexed keywords

ALGORITHMS; BANDWIDTH; DISTRIBUTED COMPUTER SYSTEMS; MULTIMEDIA SYSTEMS; PROBLEM SOLVING; ROUTERS; SET THEORY; SWITCHES; TELECOMMUNICATION;

CAYLEY GRAPHS; DEGREE/DIAMETER PROBLEM; MEAN DISTANCES; MOORE BOUND; TRANSMISSION;

GRAPH THEORY;

EID: 1242332309     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00294-4     Document Type: Conference Paper

References (16)

1. Besche H.U., Eick B. The groups of order at most 1000 except 512 and 768. J. Symbolic Comput. 27:1999;405-413.
2. Biggs N. Algebraic Graph Theory. 2nd Edition:1993;Cambridge University Press, Cambridge.
3. Bollobás B. Extremal Graph Theory. 1978;Academic Press, London, New York, San Francisco.
4. Buset D. Maximal cubic graphs with diameter 4. Discrete Appl. Math. 101:2000;53-61.
5. Buskens R.W., Rogers M.J., Stanton R.G. A census of tetravalent generalized Moore networks. Congr. Numer. 52:1986;255-296.
6. Buskens R.W., Stanton R.G. The generalized Moore graphs on eleven vertices. J. Combin. Math. Combin. Comput. 1:1987;23-66.
7. Buskens R.W., Stanton R.G. Generalized Moore graphs on twelve and thirteen vertices. Ars Combin. 23-B:1987;87-132.
8. Cerf V.G., Cowan D.D., Mullin R.C., Stanton R.G. Computer networks and generalized Moore graphs. Congr. Numer. 9:1973;379-398.
9. Cerf V.G., Cowan D.D., Mullin R.C., Stanton R.G. A lower bound on the average shortest path length in regular graphs. Networks. 4:1974;335-342.
10. Cerf V.G., Cowan D.D., Mullin R.C., Stanton R.G. Trivalent generalized Moore networks on sixteen nodes. Utilitas Math. 6:1974;259-283.
11. Cerf V.G., Cowan D.D., Mullin R.C., Stanton R.G. A partial census of trivalent generalized Moore networks. Street A.P., Wallis W.D. Proceedings of the Third Australian Conference on Combinatorial Mathematics. Lecture Notes in Mathematics. Vol. 452:1975;1-27 Springer, Berlin, Heidelberg, New York.
12. F. Comellas, http://www_mat.upc.es/grup_de_grafs/table_g.html.
13. P. Dankelmann, Mean Distance in Graphs (in German: Mittlere Entfernung in Graphen), Dissertation, RWTH Aachen, Germany, 1993.
14. Hoffman A.J., Singleton R.R. On Moore graphs with diameters 2 and 3. IBM J. Res. Develop. 4:1960;497-504.
15. Lakshmivarahan S., Jwo Jung-Sing, Dhall S.K. Symmetry in interconnection networks based on Cayley graphs of permutation groups. A survey Parallel Comput. 19:1993;361-407.
16. Sampels M. Large networks with small diameter. Möhring R.H. Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '97). Lecture Notes in Computer Science. Vol. 1335:1997;288-302 Springer, Berlin.