Lattices associated with distance-regular graphs

DOI10.1016/J.EJC.2007.02.008MaRDI QIDQ2472832zbMATH OpenOpenAlexFDO

Authors Kaishun Wang, Zengti Li

Publication date 25 February 2008

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2007.02.008

zbMATH Keywords

distance-regular graphgeometric latticeJohnson graphMöbius function

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Topological lattices (06B30)

Review text

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.

Recommendations

• Lattices associated with distance-regular graphs I
• Lattices associated with subspaces in d-bounded distance-regular graphs
• Lattices from graph associahedra
• Lattices generated by subspaces in d-bounded distance-regular graphs
• scientific article; zbMATH DE number 887765
• Eigenpolynomial of the lattices in d-bounded distance-regular graph
• Some properties of a graph associated to a lattice
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• scientific article; zbMATH DE number 3557817
• Lattice graphs with Gallai's property

Cites work

• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Lattices Generated by Orbits of Flats Under Finite Affine Groups
• Lattices generated by transitive sets of subspaces under finite classical groups I
• Lattices generated by transitive sets of subspaces under finite classical groups II the orthogonal case of odd characteristic
• Lattices generated by transitive sets of subspaces under finite classical groups III the orthogonal case of even characteristic
• Lattices generated by transitive sets of subspaces under finite pseudo-symplectic groups
• On the geometricity of lattices generated by orbits of subspaces under finite classical groups

Cited in

(5)

• A generalization of dual polar graph of orthogonal space
• Lattices associated with Hamming graphs.
• Two families of lattices.
• Lattices associated with distance-regular graphs I
• A new class of transitive graphs

This page was built for publication: Lattices associated with distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472832)