Cubical graphs and cubical dimensions (Q1102987)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cubical graphs and cubical dimensions |
scientific article; zbMATH DE number 4051688
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cubical graphs and cubical dimensions |
scientific article; zbMATH DE number 4051688 |
Statements
Cubical graphs and cubical dimensions (English)
0 references
1988
0 references
A cubical graph G is isomorphic to a subgraph of some hypercube \(Q_ n\). The cubical dimension cd(G) is the smallest such n. The induced cubical dimension icd(G) is the minimum n for which G is an induced subgraph of \(Q_ n\). The determination for a given cubical graph G of the exact values of cd(G) and icd(G) is very difficult. We discuss these values for some special classes of graphs including trees, unicyclic graphs, ``polyomino'' animals and polyhexes.
0 references
cubical graph
0 references
cubical dimension
0 references
