Embedding of the folded hypercubes into tori
From MaRDI portal
Publication:2516503
DOI10.1007/s11786-015-0223-3zbMath1317.05154OpenAlexW842981885MaRDI QIDQ2516503
Jasintha Quadras, Sarah Surya Solomon
Publication date: 3 August 2015
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-015-0223-3
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Linear wirelength of folded hypercubes
- Dense sets and embedding binary trees into hypercubes
- On reliability of the folded hypercubes
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- Exact wirelength of hypercubes on a grid
- Embedding the incomplete hypercube in books
- Embedding ladders and caterpillars into the hypercube
- Efficient embeddings of ternary trees into hypercubes.
- An edge-isoperimetric problem for powers of the Petersen graph
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- A Graph Model for Fault-Tolerant Computing Systems
- Efficient embeddings of grids into grids
- Embedding complete trees into the hypercube
