Subspaces in \(d\)-bounded distance-regular graphs and their applications

DOI10.1016/j.ejc.2007.05.001zbMath1146.05020OpenAlexW2018386270MaRDI QIDQ2426435

Lihui Fu, Baohuan Zhang, Jun Guo, Suo-gang Gao

Publication date: 22 April 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.05.001

zbMATH Keywords

distance-regular graphCartesian authentication code

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(D\)-bounded distance-regular graphs
• The combinatorics of authentication and secrecy codes
• Classical distance-regular graphs of negative type
• Problems in algebraic combinatorics
• On strongly closed subgraphs of highly regular graphs
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• Authentication Theory/Coding Theory
• Isomorphism classes of authentication codes
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Subspaces in \(d\)-bounded distance-regular graphs and their applications