Graph covers with two new eigenvalues

DOI10.1016/j.ejc.2020.103280zbMath1458.05212arXiv2003.01221OpenAlexW3010132614MaRDI QIDQ2225463

Maxwell Levit, Olha Silina, Chris D. Godsil

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.01221

zbMATH Keywords

sensitivity conjecturetwo-eigenvalue cover

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Pretty good state transfer in discrete-time quantum walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biased graphs. I: Bias, balance, and gains
• Lifts, discrepancy and nearly optimal spectral gap
• Equiangular lines and covers of the complete graph
• On generalized hexagons and a near octagon whose lines have three points
• Feasibility conditions for the existence of walk-regular graphs
• Distance regular covers of the complete graph
• Generating all graph coverings by permutation voltage assignments
• Voltage graphs
• Spectra of signed graphs with two eigenvalues
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)]
• Equiangular lines
• Antipodal covering graphs
• On signed graphs with two distinct eigenvalues
• Open problems in the spectral theory of signed graphs