Unitary signings and induced subgraphs of Cayley graphs of $\mathbb{Z}_2^{n}$

N. Alon, Kai Zheng
{"title":"Unitary signings and induced subgraphs of Cayley graphs of $\\mathbb{Z}_2^{n}$","authors":"N. Alon, Kai Zheng","doi":"10.19086/AIC.17912","DOIUrl":null,"url":null,"abstract":"Let $G$ be a Cayley graph of the elementary abelian $2$-group $\\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than half the vertices is at least $\\sqrt d$. This is deduced from the recent breakthrough result of Huang who proved the above for the $n$-hypercube $Q^n$, in which the set of generators $S$ is the set of all vectors of Hamming weight $1$. 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 $5$-regular graphs.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19086/AIC.17912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than half the vertices is at least $\sqrt d$. This is deduced from the recent breakthrough result of Huang who proved the above for the $n$-hypercube $Q^n$, in which the set of generators $S$ is the set of all vectors of Hamming weight $1$. 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 $5$-regular graphs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
$\mathbb{Z}_2^{n}$的Cayley图的幺正符号与诱导子图
设$G$是初等阿贝尔$2$-群$\mathbb{Z}_2^{n}$关于大小为$d$的集合$S$的Cayley图。我们证明了对于任意这样的$G, $ S$和$d$, $G$的任何诱导子图在任何超过一半顶点的集合上的最大度至少为$\根号d$。这是从Huang最近的突破性成果中推导出来的,他证明了$n$-超立方体$Q^n$,其中的生成元集$S$是Hamming权值$1$的所有向量的集合。在他的方法的启发下,我们定义并研究了图的邻接矩阵的酉符号,并将其与黄的正交符号进行了比较。作为一个副产品,我们回答了Belardo等人最近关于$5$正则图的谱的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Schubert Products for Permutations with Separated Descents. Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers Tit-for-Tat Strategy as a Deformed Zero-Determinant Strategy in Repeated Games An inequality for coefficients of the real-rooted polynomials $\lambda$-Core Distance Partitions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1