Two characterizations of hypercubes (Q540098)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5903027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two characterizations of hypercubes |
scientific article; zbMATH DE number 5903027 |
Statements
Two characterizations of hypercubes (English)
0 references
1 June 2011
0 references
Summary: 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.
0 references
0.8152937889099121
0 references
0.8083974123001099
0 references
0.8083445429801941
0 references
