Minimum supports of eigenfunctions of graphs: a survey
From MaRDI portal
Publication:5888902
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 2128109 (Why is no real title available?)
- scientific article; zbMATH DE number 3859396 (Why is no real title available?)
- scientific article; zbMATH DE number 4198073 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 598042 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1033392 (Why is no real title available?)
- scientific article; zbMATH DE number 3893303 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A discrete nodal domain theorem for trees
- A distribution invariant for association schemes and strongly regular graphs
- A linear bound on the Manickam-Miklós-Singhi conjecture
- A note on the Manickam-Miklós-Singhi conjecture for vector spaces
- A survey of perfect codes
- Algebraic properties of perfect structures
- An introduction to the theory of graph spectra
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
- Delsarte clique graphs
- Discrete nodal domain theorems
- Distance-regular graphs
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
- Eigenspaces of graphs
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue
- First distribution invariants and EKR theorems
- Graph Coloring Using Eigenvalue Decomposition
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Graph partitioning by eigenvectors
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- MMS-type problems for Johnson scheme
- Maximal cliques in the Paley graph of square order
- Maximal integral point sets in affine planes over finite fields
- Minimal null designs of subspace lattices over finite fields
- Minimum supports of eigenfunctions in bilinear forms graphs
- Minimum supports of eigenfunctions of Hamming graphs
- Minimum supports of eigenfunctions of Johnson graphs
- Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph
- Minimum supports of functions on the Hamming graphs with spectral constraints
- Multiplicities of eigenvalues of the star graph
- Nodal domain theorems and bipartite subgraphs
- Non-negative matrices and Markov chains.
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- Note on exact values of multiplicities of eigenvalues of the Star graph
- On completely regular codes
- On eigenfunctions and maximal cliques of Paley graphs of square order
- On existence of perfect bitrades in Hamming graphs
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- On perfect binary codes
- On perfect codes and related concepts
- On perfect colorings of Boolean \(n\)-cube and correlation immune functions with small density
- On the eigenvalues multiplicity function of the star graph
- On the minimum supports of some eigenfunctions in the Doob graphs
- On the number of nonnegative sums
- On the number of sets in a null t-design
- On the structure of (v,k,t) trades
- On the support size of null designs of finite ranked posets
- On trades: An update
- On weight distributions of perfect colorings and completely regular codes
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Perfect 2‐colorings of Hamming graphs
- Perfect binary codes: constructions, properties, and enumeration
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Some bounds for the distribution numbers of an association scheme
- Some distribution numbers of the hypercubic association scheme
- Some distribution numbers of the triangular association scheme
- Some geometric aspects of graphs and their eigenfunctions
- Spectra of graphs
- Spectrum of Cayley graphs on the symmetric group generated by transpositions
- The Laplacian spectrum of a graph
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
- The Many Proofs and Applications of Perron's Theorem
- The Perron–Frobenius Theorem and the Ranking of Football Teams
- The extended 1-perfect trades in small hypercubes
- The first distribution invariant of the Johnson-scheme
- The minimum number of nonnegative edges in hypergraphs
- The theory and application of latin bitrades: A survey
- To the theory of \(q\)-ary Steiner and other-type trades
Cited in
(6)- On a correspondence between maximal cliques in Paley graphs of square order
- Constructing MRD codes by switching
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order
- Optimal functions with spectral constraints in hypercubes
- Extremal Peisert-type graphs without the strict-EKR property
- On extended 1-perfect bitrades
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)
