Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs

DOI10.1080/10586458.2018.1542643zbMath1477.05057arXiv1808.04757OpenAlexW2963745753MaRDI QIDQ5163156

Sebastian M. Cioabă, Brendan D. McKay, Noga Alon, Brandon D. Gilbert, Jack H. Koolen

Publication date: 3 November 2021

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluerandom graphsJohnson graphsaddressingbiclique partition

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Related Items (2)

The generalized distance spectrum of a graph and applications ⋮ Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotically optimal induced universal graphs
• On a symmetric representation of Hermitian matrices and its applications to graph theory
• Proof of the squashed cube conjecture
• Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
• Addressing the Petersen graph
• Addressing graph products and distance-regular graphs
• A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• The biparticity of a graph
• Sharp bounds for decompositions of graphs into completer-partite subgraphs
• On the Addressing Problem for Loop Switching

This page was built for publication: Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs