Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three (Q1372727): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:07, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three |
scientific article |
Statements
Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three (English)
0 references
4 May 1998
0 references
Given a Cartesian product of nontrivial connected graphs and a de Bruijn graph \(B(d,D)\) of base \(d\) and dimension \(D\), the paper studies the conditions under which the Cartesian product is a subgraph of \(B(d,D)\). It gives a complete solution to this problem for the case \(D\geq 4\). For \(D=3\) it gives partial results including a complete solution for the case that the Cartesian product is the product of cycles.
0 references
de Bruijn graph
0 references
Cartesian product
0 references
subgraph
0 references