Minimum supports of eigenfunctions of graphs: a survey
DOI10.26493/2590-9770.1404.61EOpenAlexW3205041877MaRDI QIDQ5888902FDOQ5888902
Authors: Ev V. Sotnikova, Alexandr Valyuzhenich
Publication date: 25 April 2023
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.11142
tradeeigenfunctioneigenspacebitrademinimum support1-perfect bitradeeigenfunctions of graphsweight distribution bound
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of graphs
- Eigenspaces of graphs
- An introduction to the theory of graph spectra
- Delsarte clique graphs
- A linear bound on the Manickam-Miklós-Singhi conjecture
- Non-negative matrices and Markov chains.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
- First distribution invariants and EKR theorems
- Title not available (Why is that?)
- Graph partitioning by eigenvectors
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Distance-regular graphs
- Title not available (Why is that?)
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Title not available (Why is that?)
- Discrete nodal domain theorems
- The theory and application of latin bitrades: A survey
- Title not available (Why is that?)
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- On perfect codes and related concepts
- A survey of perfect codes
- The Laplacian spectrum of a graph
- Title not available (Why is that?)
- Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
- A discrete nodal domain theorem for trees
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- On weight distributions of perfect colorings and completely regular codes
- On perfect colorings of Boolean \(n\)-cube and correlation immune functions with small density
- Some geometric aspects of graphs and their eigenfunctions
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- On trades: An update
- The minimum number of nonnegative edges in hypergraphs
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- On the number of nonnegative sums
- A note on the Manickam-Miklós-Singhi conjecture for vector spaces
- The Many Proofs and Applications of Perron's Theorem
- Perfect binary codes: constructions, properties, and enumeration
- The first distribution invariant of the Johnson-scheme
- Spectrum of Cayley graphs on the symmetric group generated by transpositions
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Title not available (Why is that?)
- A distribution invariant for association schemes and strongly regular graphs
- To the theory of \(q\)-ary Steiner and other-type trades
- Minimum supports of eigenfunctions of Hamming graphs
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- The Perron–Frobenius Theorem and the Ranking of Football Teams
- On the structure of (v,k,t) trades
- On perfect binary codes
- Graph Coloring Using Eigenvalue Decomposition
- Maximal cliques in the Paley graph of square order
- On the number of sets in a null t-design
- Nodal domain theorems and bipartite subgraphs
- Some bounds for the distribution numbers of an association scheme
- Maximal integral point sets in affine planes over finite fields
- Some distribution numbers of the hypercubic association scheme
- Some distribution numbers of the triangular association scheme
- MMS-type problems for Johnson scheme
- On the eigenvalues multiplicity function of the star graph
- 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
- Minimal null designs of subspace lattices over finite fields
- 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
- The extended 1-perfect trades in small hypercubes
- On existence of perfect bitrades in Hamming graphs
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Multiplicities of eigenvalues of the star graph
- Note on exact values of multiplicities of eigenvalues of the Star graph
- Algebraic properties of perfect structures
- On completely regular codes
- Perfect 2‐colorings of Hamming graphs
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue
- Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph
- Minimum supports of eigenfunctions in bilinear forms graphs
Cited In (6)
- On a correspondence between maximal cliques in Paley graphs of square order
- Optimal functions with spectral constraints in hypercubes
- On extended 1-perfect bitrades
- Constructing MRD codes by switching
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order
- Extremal Peisert-type graphs without the strict-EKR property
This page was built for publication: Minimum supports of eigenfunctions of graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888902)