×

zbMATH — the first resource for mathematics

Large Cayley graphs and digraphs with small degree and diameter. (English) Zbl 0830.05025
Bosma, Wieb (ed.) et al., Computational algebra and number theory. Based on a meeting on computational algebra and number theory, held at Sydney University, Sydney, Australia, November of 1992. Dordrecht: Kluwer Academic Publishers. Math. Appl., Dordr. 325, 291-302 (1995).
The degree/diameter problem asks to find (di-)graphs of maximal order with given maximal (in- and out-)degree and diameter. This paper reviews the status of the problem and presents new Cayley digraphs which yield improvements over some of the previous known orders concerning vertex transitive digraphs.
For the entire collection see [Zbl 0818.00003].

MSC:
05C12 Distance in graphs
05C20 Directed graphs (digraphs), tournaments
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
05C90 Applications of graph theory
90B18 Communication networks in operations research
94C15 Applications of graph theory to circuits and networks
PDF BibTeX XML Cite