## Given a Cartesian product G of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 Γ β’ β’ β’ Γ G m which are relevant for parallel computing, namely, to
Regular embeddings of Cartesian product graphs
β Scribed by Jun-Yang Zhang
- Book ID
- 113567436
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 224 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Surgical techniques are often effective in constructing genus embeddings of cartesian products of bipartite graphs. In this paper we present a general construction that is βcloseβ to a genus embedding for cartesian products, where each factor is βcloseβ to being bipartite. In specializi
## Abstract A special type of surgery developed by A. T. White and later used by the author to construct orientable quadrilateral embeddings of Cartesian products of graphs is here expanded to cover the nonorientable case as well. This enables the nonorientable genus of many families of Cartesian p