Characterizing imprimitive partition designs of binary Hamming graphs

DOI10.1016/J.EJC.2003.11.001MaRDI QIDQ1827338zbMATH OpenOpenAlexFDO

Authors Roberto Canogar

Publication date 6 August 2004

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

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

zbMATH Keywords

partition designbinary Hamming graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Recommendations

• Partition designs with two subsets of the Hamming space
• Codes, designs and groups from the Hamming graphs
• On \(r\)-partition designs in Hamming spaces
• An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix
• Equitable 2-partitions of the Hamming graphs with the second eigenvalue

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix
• Completely regular designs
• Distance-regularised graphs are distance-regular or distance-biregular
• On \(r\)-partition designs in Hamming spaces
• Problems in algebraic combinatorics

Cited in

(4)

• Equitable 2-partitions of the Hamming graphs with the second eigenvalue
• Partition designs with two subsets of the Hamming space
• An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix
• On \(r\)-partition designs in Hamming spaces

This page was built for publication: Characterizing imprimitive partition designs of binary Hamming graphs

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