Minimum supports of eigenfunctions in bilinear forms graphs
From MaRDI portal
Publication:2633614
DOI10.33048/semi.2019.16.032zbMath1416.05181OpenAlexW3016126338MaRDI QIDQ2633614
Publication date: 9 May 2019
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2019.16.032
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Related Items (4)
Minimum supports of eigenfunctions of graphs: a survey ⋮ Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph ⋮ Optimal functions with spectral constraints in hypercubes ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- Minimum supports of eigenfunctions of Hamming graphs
- On weight distributions of perfect colorings and completely regular codes
- Delsarte clique graphs
- 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
- Minimum supports of functions on the Hamming graphs with spectral constraints
- Minimal null designs of subspace lattices over finite fields
- Démonstration d'une hypothèse de M. Artin
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
This page was built for publication: Minimum supports of eigenfunctions in bilinear forms graphs
