On middle cube graphs
C. Dalf\'o, M.A. Fiol, M. Mitjana

TL;DR
This paper investigates the properties of middle cube graphs, a family related to hypercubes, focusing on their spectral characteristics and their relation to distance-regular graphs.
Contribution
It provides a complete spectral characterization of middle cube graphs and explores their connection to odd graphs within the framework of distance-regular graphs.
Findings
Eigenvalues and multiplicities are explicitly determined.
Middle cube graphs are shown to be related to odd graphs by doubling vertices.
The spectral properties reveal insights into their structure and regularity.
Abstract
We study a family of graphs related to the -cube. The middle cube graph of parameter is the subgraph of induced by the set of vertices whose binary representation has either or number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · graph theory and CDMA systems
