Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs

DOI10.1016/j.disc.2007.04.043zbMath1151.05052OpenAlexW1990401471MaRDI QIDQ952653

Jun Guo, Suo-gang Gao

Publication date: 12 November 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.043

zbMATH Keywords

distance-regular graphgeometric latticestrongly closed subgraphseigenpolynomial

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Semimodular lattices, geometric lattices (06C10)

Related Items (3)

Erdős-Ko-Rado theorems in certain semilattices ⋮ Posets associated with subspaces in a \(d\)-bounded distance-regular graph ⋮ Lattices generated by subspaces in \(d\)-bounded distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(D\)-bounded distance-regular graphs
• Arrangements in unitary and orthogonal geometry over finite fields
• Classical distance-regular graphs of negative type
• On strongly closed subgraphs of highly regular graphs
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• 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 Orbits of Subspaces Under Finite Singular Classical Groups and Its Characteristic Polynomials
• Lattices Generated by Orbits of Flats Under Finite Affine Groups
• A new 5‐arc‐transitive cubic graph
• On the geometricity of lattices generated by orbits of subspaces under finite classical groups

This page was built for publication: Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs