Minimum supports of functions on the Hamming graphs with spectral constraints

DOI10.1016/j.disc.2019.01.015zbMath1407.05226arXiv1807.09139OpenAlexW2883441239WikidataQ128435477 ScholiaQ128435477MaRDI QIDQ1732769

Alexandr Valyuzhenich, Konstantin Vorob'ev

Publication date: 25 March 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.09139

zbMATH Keywords

Hamming grapheigenfunctionsupport

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Minimum supports of eigenfunctions of graphs: a survey ⋮ Minimum supports of eigenfunctions in bilinear forms graphs ⋮ Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ Optimal functions with spectral constraints in hypercubes ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph ⋮ Algebraic properties of perfect structures ⋮ On existence of perfect bitrades in Hamming graphs ⋮ Norton algebras of the Hamming graphs via linear characters

Cites Work

• Unnamed Item
• Multidimensional Latin bitrades
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• On perfect 2-colorings of the \(q\)-ary \(n\)-cube
• Minimum supports of eigenfunctions of Hamming graphs
• Switching codes and designs
• To the theory of \(q\)-ary Steiner and other-type trades
• On the support size of null designs of finite ranked posets
• Minimum supports of eigenfunctions of Johnson graphs
• On eigenfunctions and maximal cliques of Paley graphs of square order
• Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
• On the minimum supports of some eigenfunctions in the Doob graphs
• The extended 1-perfect trades in small hypercubes
• The minimum volume of subspace trades
• The theory and application of latin bitrades: A survey
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

This page was built for publication: Minimum supports of functions on the Hamming graphs with spectral constraints