A group commutator involving the last distance matrix and dual distance matrix of a \(Q\)-polynomial distance-regular graph: the Hamming graph case

DOI10.1007/s00373-018-1915-7zbMath1395.05195OpenAlexW2808082419MaRDI QIDQ2413647

Siwaporn Mamart

Publication date: 14 September 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1915-7

zbMATH Keywords

distance-regular graph\(Q\)-polynomialdistance matrixdual distance matrix

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The Terwilliger algebra of the hypercube
• Bipartite distance-regular graphs. I
• On the multiplicities of the primitive idempotents of a \(Q\)-polynomial distance-regular graph
• The switching element for a Leonard pair
• The displacement and split decompositions for a \(Q\)-polynomial distance-regular graph
• A generalization of the Terwilliger algebra
• Two linear transformations each tridiagonal with respect to an eigenbasis of the other
• Unnamed Item
• Unnamed Item

This page was built for publication: A group commutator involving the last distance matrix and dual distance matrix of a \(Q\)-polynomial distance-regular graph: the Hamming graph case