Lattices associated with distance-regular graphs (Q2472832): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3050437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite classical groups I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite classical groups II the orthogonal case of odd characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite classical groups III the orthogonal case of even characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite pseudo-symplectic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometricity of lattices generated by orbits of subspaces under finite classical groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices Generated by Orbits of Flats Under Finite Affine Groups / rank
 
Normal rank

Latest revision as of 16:48, 27 June 2024

scientific article
Language Label Description Also known as
English
Lattices associated with distance-regular graphs
scientific article

    Statements

    Lattices associated with distance-regular graphs (English)
    0 references
    0 references
    0 references
    25 February 2008
    0 references
    The author investigates three types of graphs: distance-regular graphs of order \((s,t)\), Johnson graphs and antipodal distance-regular graphs of diameter \(d\). With these graphs he associates partial orders, in case of the Johnson graph \(J(dm,d)\) and the distance-regular graphs of diameter \(d\) the partial order of all \(d\)-cliques and in case of distance-regular graphs the partial order of all cliques. These partial orders are atomic lattices. In case of a distance-regular graph this is a geometric lattice, for \(J(dm,d)\) it is a geometric lattice iff \(d=1\) and for the antipodal graph it is not a geometric lattice. The author determines the Möbius functions of these lattices and computes their characteristic polynomials.
    0 references
    0 references
    distance-regular graph
    0 references
    Johnson graph
    0 references
    geometric lattice
    0 references
    Möbius function
    0 references

    Identifiers