Abstract

The nn-cube graph is the graph on the vertex set of nn-tuples of 00s and 11s, with two vertices joined by an edge if and only if the nn-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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.