Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs

DOI10.1016/J.EJC.2006.05.011MaRDI QIDQ2372439zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 July 2007

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

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

zbMATH Keywords

finite atomic latticesgeometric lattices

Mathematics Subject Classification ID

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

Recommendations

• Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs
• Eigenpolynomial of the lattices in d-bounded distance-regular graph
• Lattices generated by subspaces in d-bounded distance-regular graphs
• Lattices associated with subspaces in d-bounded distance-regular graphs
• scientific article; zbMATH DE number 6107248

Cites work

• D-bounded distance-regular graphs
• A new 5‐arc‐transitive cubic graph
• Arrangements in unitary and orthogonal geometry over finite fields
• Classical distance-regular graphs of negative type
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• Lattices Generated by Orbits of Subspaces Under Finite Singular Classical Groups and Its Characteristic Polynomials
• 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
• On the geometricity of lattices generated by orbits of subspaces under finite classical groups
• STRONGLY CLOSED SUBGRAPHS OF A DISTANCE-REGULAR GRAPH WITH GEOMETRIC GIRTH FIVE

Cited in

(15)

• An application of a construction theory of strongly closed subgraphs in a distance-regular graph
• Lattices generated by joins of the flats in orbits under finite affine-singular symplectic group and its characteristic polynomials
• Deterministic construction of compressed sensing matrices based on semilattices
• Subspaces in \(d\)-bounded distance-regular graphs and their applications
• Erdős-Ko-Rado theorems in certain semilattices
• Lattices associated with distance-regular graphs
• Lattices generated by subspaces in d-bounded distance-regular graphs
• Lattices associated with distance-regular graphs I
• Eigenpolynomial of the lattices in d-bounded distance-regular graph
• Pooling semilattices and non-adaptive pooling designs
• Lattices associated with subspaces in d-bounded distance-regular graphs
• Two new error-correcting pooling designs from d-bounded distance-regular graphs
• Pooling spaces associated with finite geometry
• Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs
• Posets associated with subspaces in a d-bounded distance-regular graph

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

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