Usually the adjacency matrix representation of the n-dimensional hypercube, $Q_n$, is given as $$Q_n=\begin{bmatrix}Q_{n-1} & I \\ I & Q_{n-1} \end{bmatrix}$$ where $Q_1$ is the adjacency matrix of $K_2$. Since the $1$-dimensional hypercube is $K_2$ and the $2$-dimensional hypercube is $C_4$ which are also circulant graphs I was wondering if all $n$-dimensional hypercubes are circulant graphs and if so what is the circulant matrix representation of their adjacency matrix.
2026-03-25 03:02:26.1774407746
Are all n-dimensional hypercube graphs circulant and if so what is their circulant adjacency matrix?
437 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in ADJACENCY-MATRIX
- Shape of the graph spectrum
- Use the definition of matrix multiplication to explain why the analogous result holds for any entry of Adjacency Matrix $A^2$.
- Do isomorphic graphs have same values for adjacency matrices and spectrum?
- Edge-to-edge incidence structure of a graph
- Is there an approximation to a matrix $V = (I-cA)^{-1}$ where $I$ is the identity matrix and $A$ is an adjacency matrix of a connected graph?
- Is it possible to normalize a symmetric matrix without breaking symmetry?
- Spectral radius of a complete bipartite graph
- What is a suitable index to express similarity in two observations of the same set of variables containing ratios?
- How to find Eulerian path in the given graph?
- Spectral radius of a complete tripartite graph
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The $d$-cube is not a circulant if $d\ge3$. In fact something stronger is true.
Suppose $G$ is an abelian group acting regularly as a group of automorphisms of the $d$-cube $Q_d$. Then $Q_d$is a Cayley graph for $G$, with connection set $C$ (say).
Define two elements $g$ and $h$ of $G$ to be equivalent if they generate the same subgroup of $G$. It is known that if the eigenvalues of a Cayley graph for an abelian group are integers, $C$ must be a union of equivalence classes. (Bridges and Mena "Rational G-matrices with rational eigenvalues", JCT A, 32 (1982), 264-280.)
Assume now that the exponent of $G$ is $2^m$, where $m\ge3$. Since the $d$-cube is connected, $C$ must be a generating set for $G$ and hence it contains an element of order $2^m$, and hence $C$ contains all $2^{m-1}$ generators of some subgroup of order $2^m$. It follows that the $d$-cube must have an induced subgraph isomorphic to $K_{2^{m-1},2^{m-1}}$ and, in particular contains a copy of $K_{3,3}$.
To complete the argument we show by induction on $d$ that $Q_d$ does not contains an induced subgraph isomorphic to $K_{3,3}$. The key is that we cannot disconnect $K_{3,3}$ by deleting the edges of a perfect matching (exercise: note that all perfect matchings are equivalent under the automorhism group). But the $d$-cube consists of two copies of the $Q_{d-1}$-cube joined by a perfect matching, and so any copy of $K_{3,3}$ must lie in one of the copies of $Q_{d-1}$, which leads to a contradiction.
So the $d$-cube cannot be a Cayley group for an abelian group of exponent greater than four. Note that if $d=2e$, then it is a Cayley graph for $\mathbb{Z}_4^e$.