Two characterizations of hypercubes
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Two characterizations of hypercubes are given: 1) A graph is a hypercube if and only if it is antipodal and bipartite $(0,2)$-graph. 2) A graph is an $n$-hypercube if and only if there are $n$ pairs of prime convexes, the graph is a prime convex intersection graph, and each intersection of $n$ prime convexes (no one of which is from the same pair) is a vertex.
@article{10_37236_584,
author = {Juhani Nieminen and Matti Peltola and Pasi Ruotsalainen},
title = {Two characterizations of hypercubes},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/584},
zbl = {1217.05195},
url = {http://geodesic.mathdoc.fr/articles/10.37236/584/}
}
Juhani Nieminen; Matti Peltola; Pasi Ruotsalainen. Two characterizations of hypercubes. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/584
Cité par Sources :