A characterization of the components of the graphs \(D(k,q)\) (Q1924372)

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 935384
Language Label Description Also known as
default for all languages
No label defined
    English
    A characterization of the components of the graphs \(D(k,q)\)
    scientific article; zbMATH DE number 935384

      Statements

      A characterization of the components of the graphs \(D(k,q)\) (English)
      0 references
      0 references
      0 references
      0 references
      4 May 1997
      0 references
      The graphs \(D(k,q)\) first arose in the context of extremal graph theory because of their large girth. Each graph \(D(k,q)\) is \(q\)-regular, bipartite, of order \(2q^k\), of girth at least \(k+5\) (for \(k\) odd), and its automorphism group is transitive on each of its bipartition sets as well as on its set of edges. This paper proves that \(D(k,q)\) has at least \(q^{t-1}\) components (where \(t=\lfloor{k+2\over 4}\rfloor\)) and completely characterizes the structure of \(D(k,q)\).
      0 references
      characterization
      0 references
      graphs \(D(k,q)\)
      0 references
      extremal graph
      0 references
      girth
      0 references
      automorphism group
      0 references
      components
      0 references

      Identifiers