A family of graphs and the degree/diameter problem
Given a suitable permutation \(\sigma\) of \(V(K_n)\), a family of graphs is described with the help of the union of orbits of \(\sigma\) in its action on \(E(K_n)\). Some of the graphs in this family turn out to be the largest known graphs for certain degree/diameter values.
scientific article; zbMATH DE number 1652668