A characterization of the components of the graphs \(D(k,q)\) (Q1924372): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andrew J. Woldar / rank
Normal rank
 
Property / author
 
Property / author: Andrew J. Woldar / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of prescribed girth and bi-degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of graphs with an arbitrary large girth and of large size / rank
 
Normal rank
Property / cites work
 
Property / cites work: New examples of graphs without small cycles and of large size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863514 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:15, 24 May 2024

scientific article
Language Label Description Also known as
English
A characterization of the components of the graphs \(D(k,q)\)
scientific article

    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
    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