The Smith group of the hypercube

Abstract

The n-cube graph is the graph on the vertex set of n-tuples of 0s and 1s, with two vertices joined by an edge if and only if the n-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently, the elementary divisors of an adjacency matrix of the graph.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…