Unitary signings and induced subgraphs of Cayley graphs of Z₂^n
From MaRDI portal
Publication:5144437
Abstract: Let be a Cayley graph of the elementary abelian -group with respect to a set of size . We prove that for any such and , the maximum degree of any induced subgraph of on any set of more than half the vertices is at least . This is deduced from the recent breakthrough result of Huang who proved the above for the -hypercube , in which the set of generators is the set of all vectors of Hamming weight . Motivated by his method we define and study unitary signings of adjacency matrices of graphs, and compare them to the orthogonal signings of Huang. As a byproduct, we answer a recent question of Belardo et. al. about the spectrum of signed -regular graphs.
Recommendations
Cited in
(13)- On the forcing matching numbers of prisms of graphs
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- Unitary Cayley meet signed graphs
- On sensitivity in bipartite Cayley graphs
- Counterexamples to ``A conjecture on induced subgraphs of Cayley graphs
- Unitary Addition Cayley Ring Signed Graphs *
- Subsets of Cayley graphs that induce many edges
- Induced subgraphs of product graphs and a generalization of Huang's theorem
- Induced subgraph and eigenvalues of some signed graphs
- scientific article; zbMATH DE number 7733107 (Why is no real title available?)
- On induced subgraph of Cartesian product of paths
- The inertia bound is far from tight
- Sensitivity and Hamming graphs
This page was built for publication: Unitary signings and induced subgraphs of Cayley graphs of \(\mathbb{Z}_2^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144437)