Subspaces in d-bounded distance-regular graphs and their applications

DOI10.1016/J.EJC.2007.05.001MaRDI QIDQ2426435zbMATH OpenOpenAlexFDO

Authors Jun Guo, Baohuan Zhang, Lihui Fu, Suogang 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

Cartesian authentication codedistance-regular graph

Mathematics Subject Classification ID

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

Review text

\textit{C.-W. Weng} [Eur. J. Comb. 18, No. 2, 211--229 (1997; Zbl 0869.05025), and J. Comb. Theory, Ser. B 76, No. 1, 93--116 (1999; Zbl 0938.05067)] studied \(d\)-bounded distance-regular graphs with diameter \(d\) and their subspaces. This paper deals with such graphs \(\Gamma\) of diameter \(d(\Gamma)=d\geq 3\). For a vertex \(x\) let \(P(x)\) denote the set of all subspaces in \(\Gamma\) containing \(x\). Let \(0\leq t\leq i+t\), \(j+t\leq i+j+t\leq d_1\leq d\) and suppose that \(\Delta\) and \(\Delta^*\) are subspaces with diameter \(i+t\) and \(d_1\) in \(P(x)\), respectively. In the case \(\Delta\subseteq\Delta^*\) the authors determine the number of subspaces \(\Delta'\) with diameter \(j+t\) such that \(d(\Delta\cap\Delta')=t\) and \(d(\Delta+\Delta')=i+j+t\). These subspaces are used to construct a new Cartesian authentication code.

Recommendations

• Subspaces in d-bounded distance-regular graphs and authentication code with perfect secrecy.
• A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs.
• Lattices associated with subspaces in d-bounded distance-regular graphs
• Posets associated with subspaces in a d-bounded distance-regular graph
• scientific article; zbMATH DE number 6107248

Cites work

• D-bounded distance-regular graphs
• A new 5‐arc‐transitive cubic graph
• Authentication Theory/Coding Theory
• Classical distance-regular graphs of negative type
• 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 90004 (Why is no real title available?)
• Isomorphism classes of authentication codes
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• On strongly closed subgraphs of highly regular graphs
• Problems in algebraic combinatorics
• The combinatorics of authentication and secrecy codes

Cited in

(5)

• Erdős-Ko-Rado theorems in certain semilattices
• Subspaces in d-bounded distance-regular graphs and authentication code with perfect secrecy.
• A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs.
• scientific article; zbMATH DE number 6107248 (Why is no real title available?)
• Posets associated with subspaces in a d-bounded distance-regular graph

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

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