Lattices associated with distance-regular graphs (Q2472832)

From MaRDI portal
Revision as of 01:25, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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