Cubical graphs and cubical dimensions
type: Item
instance of: scholarly article
title: Cubical graphs and cubical dimensions
zbMATH Open document ID: 0645.05066
DOI: 10.1016/0898-1221(88)90212-X
author: Frank Harary
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05B50
zbMATH DE Number: 4051688
zbMATH Keywords: cubical graph
zbMATH Keywords: cubical dimension
MaRDI profile type: Publication
cites work: Parallel concepts in graph theory
cites work: On cubical graphs
cites work: A survey of the theory of hypercube graphs
cites work: The enumeration of tree-like polyhexes
cites work: On Homeomorphic Embeddings of Km,n in the Cube
cites work: Embedding the dichotomic tree into the $n$-cube
full work available at URL: 0898-1221(88)90212-x
OpenAlex ID: W2094656226
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4051688