Minimum supports of eigenfunctions of Johnson graphs
From MaRDI portal
Publication:1637129
DOI10.1016/J.DISC.2018.04.018zbMath1388.05119arXiv1706.03987OpenAlexW2963410367MaRDI QIDQ1637129
Alexandr Valyuzhenich, Konstantin Vorob'ev, Ivan Yu. Mogilnykh
Publication date: 7 June 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.03987
Related Items (10)
Minimum supports of eigenfunctions of graphs: a survey ⋮ MMS-type problems for Johnson scheme ⋮ Minimum supports of eigenfunctions in bilinear forms graphs ⋮ Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs ⋮ Optimal functions with spectral constraints in hypercubes ⋮ Inclusion matrices for rainbow subsets ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph ⋮ Minimum supports of functions on the Hamming graphs with spectral constraints ⋮ On reconstruction of eigenfunctions of Johnson graphs ⋮ The EKR-module property of pseudo-Paley graphs of square order
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum supports of eigenfunctions of Hamming graphs
- Induced perfect colorings
- To the theory of \(q\)-ary Steiner and other-type trades
- On the structure of (v,k,t) trades
- Combinatorial \(S_ n\)-modules as codes
- On the support size of null designs of finite ranked posets
- Minimal null designs of subspace lattices over finite fields
- Combinatorial designs and algebras
- On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\)
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- Completely regular designs
- On the number of inequivalent steiner triple systems
This page was built for publication: Minimum supports of eigenfunctions of Johnson graphs
