On the girth of the bipartite graph \(D(k, q)\) (Q400434): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Isomorphism criterion for monomial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monomial graphs of girth eight / 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: On small world semiplanes with generalised Schubert cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles / 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: Explicit construction of graphs with an arbitrary large girth 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: A characterization of the components of the graphs \(D(k,q)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polarities and \(2k\)-cycle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite series of regular edge- but not vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of certain graphs of high girth. / rank
 
Normal rank
Property / cites work
 
Property / cites work: General properties of some families of graphs defined by systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homogeneous algebraic graphs of large girth and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of Wenger graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s / rank
 
Normal rank

Latest revision as of 21:57, 8 July 2024

scientific article
Language Label Description Also known as
English
On the girth of the bipartite graph \(D(k, q)\)
scientific article

    Statements

    On the girth of the bipartite graph \(D(k, q)\) (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2014
    0 references
    bipartite graph
    0 references
    girth
    0 references
    edge-transitive
    0 references
    automorphism
    0 references
    algebraic graph
    0 references

    Identifiers