Large networks with small diameter

DOI10.1007/BFB0024505MaRDI QIDQ4373688zbMATH OpenFDO

Authors Michael Sampels

Publication date 16 February 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0024505

zbMATH Keywords

Cayley graphdiameterdistancenetwork

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Review text

Cayley graph techniques can be used to construct graphs with small diameter \(D\) for a given maximal degree \(\Delta\). In the present paper, the concept of Caylay graph is introduced and an idea for the representation of all vertex-symmetric graphs is given. Moreover, genetic algorithms used in the search for large Cayley graphs with small diameter and given degree \(\Delta\) are described. The result is an updated table of the best-known \((\Delta, D)\)-graphs and a table with the largest known graphs for a given \(\Delta\) and maximum average distance between the vertices. For the entire collection see [Zbl 0877.00011].

Recommendations

• Large Cayley graphs of small diameter
• New results for the degree/diameter problem
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
• Cayley graphs of given degree and diameters 3, 4 and 5
• Large butterfly Cayley graphs and digraphs

Cited in

(7)

• Vertex-symmetric generalized Moore graphs.
• Cubic Cayley graphs with small diameter
• Diamètre de graphes et qualité de service d'un réseau de données
• scientific article; zbMATH DE number 177869 (Why is no real title available?)
• The Design of Small-Diameter Networks by Local Search
• New results for the degree/diameter problem
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)

This page was built for publication: Large networks with small diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373688)