✦ LIBER ✦

Embeddings of chemical graphs in hypercubes

✍ Scribed by M. Deza; M. I. Shtogrin

Book ID: 110613842
Publisher: SP MAIK Nauka/Interperiodica
Year: 2000
Tongue: English
Weight: 1024 KB
Volume: 68
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf02674552

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Scale Embeddings of Graphs into Hyper

On Scale Embeddings of Graphs into Hypercubes

✍ S.V. Shpectorov 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Embeddings in hypercubes

✍ Marilynn Livingston; Quentin F. Stout 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Embeddings of Hypercubes and Grids into

Embeddings of Hypercubes and Grids into de Bruijn Graphs

✍ M.C. Heydemann; J. Opatrny; D. Sotteau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 644 KB

An embedding of a graph \(G\) into a graph \(H\) is an injective mapping \(f\) from the vertices of \(G\) into the vertices of \(H\) together with a mapping \(P_{f}\) of edges of \(G\) into paths in \(H\). The dilation of the embedding is the maximum taken over all the lengths of the paths \(P_{f}(x

On embedding complete graphs into hyperc

On embedding complete graphs into hypercubes

✍ Michael Klugerman; Alexander Russell; Ravi Sundaram 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Matrix Representation of Graph Embedding

Matrix Representation of Graph Embedding in a Hypercube

✍ Y.C. Tseng; T.H. Lai; L.F. Wu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 707 KB

The purpose of this paper is to demonstrate the use of matrices for the representation of graph embedding in a hypercube. We denote the image of an embedding (which is a subgraph of the hypercube) as a matrix. With this representation, we are able to simplify, unify, generalize, or improve existing

Small congestion embedding of graphs int

Small congestion embedding of graphs into hypercubes

✍ Matsubayashi, Akira; Ueno, Shuichi 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB 👁 1 views

We consider the problem of embedding graphs into hypercubes with minimal congestion. Kim and Lai showed that for a given N-vertex graph G and a hypercube it is NP-complete to determine whether G is embeddable in the hypercube with unit congestion, but G can be embedded with unit congestion in a hype