๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Embedding of hypercubes into necklace, windmill and snake graphs

โœ Scribed by Indra Rajasingh; Bharati Rajan; R. Sundara Rajan

Book ID
113663350
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
237 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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 the embedding of graphs into graphs w
On the embedding of graphs into graphs with few eigenvalues
โœ Vu, Van H. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic