A note on constructing large Cayley graphs of given degree and diameter by voltage assignments (Q1379133)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1119074
Language Label Description Also known as
default for all languages
No label defined
    English
    A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
    scientific article; zbMATH DE number 1119074

      Statements

      A note on constructing large Cayley graphs of given degree and diameter by voltage assignments (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      18 February 1998
      0 references
      Summary: Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for application to the degree/diameter problem, which is to determine the largest order of a graph with given degree and diameter. Many currently known largest graphs of degree at most 15 and diameter at most 10 have been found by computer search among Cayley graphs of semidirect products of cyclic groups. We show that all of them can in fact be described as lifts of smaller Cayley graphs of cyclic groups, with voltages in (other) cyclic groups. This opens up a new possible direction in the search for large vertex-transitive graphs of given degree and diameter.
      0 references
      base graphs
      0 references
      diameter problem
      0 references
      Cayley graphs
      0 references
      cyclic groups
      0 references
      voltages
      0 references
      vertex-transitive graphs
      0 references

      Identifiers