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

binary Hamming graphspartition design

Mathematics Subject Classification ID

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

Review text

Let \(m\in N\). The binary Hamming graph of diameter \(m\), \(H(m)\), has as vertices the elements of \(F^m\). The edges join vertices at distance one, where the distance between two vertices is the number of different coordinates. Since the Hamming graph \(H(m)\) is distance-regular, the distance partition from any vertex is a partition design. To find all partition designs that are characterized by their adjacency matrix seems to be a very difficult problem. Instead of considering all partition designs, only imprimitive partition designs have been considered in this paper. Let \(G= (V,E)\) be a binary Hamming graph (or 1-skeleton of a hypercube). A partition design of \(G\) with adjacency matrix \(M= (m_{ij})_{1\leq i,j\leq r}\) is defined as a partition \(\{Y_1,Y_2,\dots, Y_r\}\) of the vertex set \(V\) such that for every \(x\in Y_i\) we can have \(|\{y\in Y_j\mid (x,y)\in E\}|= m_{ij}\); this holds for \(1\leq i,\,j\leq r\). Let \(Y\) be a partition design with adjacency matrix \(M\). For every \(t\geq 2\), the author constructs a partition design \(Y^t\) with adjacency matrix \(tM\), and describes when \(Y^t\) is the unique partition design with adjacency matrix \(tM\).

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

• 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
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• On \(r\)-partition designs in Hamming spaces
• Problems in algebraic combinatorics

Cited in

(4)

• On \(r\)-partition designs in Hamming spaces
• 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

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)