5度正交符号图
Orthogonal signed graphs of degree 5
浏览论文内容
中文总结 AI 辅助
本文完成了最大度为5的正交符号图的分类，并构造了6正则和8正则正交符号图的新的无限族，推进了该领域的研究。
中文摘要 AI 辅助
正交符号图是连通符号图，其符号邻接矩阵的行两两正交。它们与Hadamard矩阵、等角直线最大排列、二部Ramanujan图以及灵敏度猜想的显著解决密切相关。度至多为4的正交符号图已被完全分类，而度5的部分结果已知。我们完成了最大度为5的正交符号图的分类。我们还提供了若干新的6正则和8正则正交符号图的无限族。
英文摘要
An orthogonal signed graph is a connected signed graph whose signed adjacency matrix has pairwise orthogonal rows. They are closely related to Hadamard matrices, maximal arrangements of equiangular lines, bipartite Ramanujan graphs, and the remarkable resolution of the Sensitivity Conjecture. Orthogonal signed graphs of degree at most 4 have been completely classified, and partial results were known for degree 5. We complete the classification of orthogonal signed graphs of maximum degree 5. We also provide several new infinite families of 6- and 8-regular orthogonal signed graphs.
发表机构
- York University（约克大学）
- Simon Fraser University（西蒙菲莎大学）
- Institute for Research in Fundamental Sciences (IPM)（基础科学研究院）
机构由 AI 辅助整理，请以论文原文为准。
