E-resources
-
Valyuzhenich, Alexandr
Discrete mathematics, March 2021, 2021-03-00, Volume: 344, Issue: 3Journal Article
The Hamming graph H(n,q) is the graph whose vertices are the words of length n over the alphabet {0,1,…,q−1}, where two vertices are adjacent if they differ in exactly one coordinate. The adjacency matrix of H(n,q) has n+1 distinct eigenvalues n(q−1)−q⋅i with corresponding eigenspaces Ui(n,q) for 0≤i≤n. In this work we study functions belonging to a direct sum Ui(n,q)⊕Ui+1(n,q)⊕⋯⊕Uj(n,q) for 0≤i≤j≤n. We find the minimum cardinality of the support of such functions for q=2 and for q=3, i+j>n. In particular, we find the minimum cardinality of the support of eigenfunctions from the eigenspace Ui(n,3) for i>n2. Using the correspondence between 1-perfect bitrades and eigenfunctions with eigenvalue −1, we find the minimum size of a 1-perfect bitrade in the Hamming graph H(n,3).
Author
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.