Multiple regular graph embeddings into a hypercube with unbounded expansion

DOI10.1016/j.amc.2013.06.033zbMath1329.05214OpenAlexW1965593674MaRDI QIDQ902523

Jen-Chih Lin

Publication date: 18 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.06.033

zbMATH Keywords

ringhypercubetorusmeshlinear array

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipanconnectivity of faulty hypercubes with minimum degree
• Embedding meshes into twisted-cubes
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
• Embedding multi-dimensional meshes into twisted cubes
• Embedding of tori and grids into twisted cubes
• Embedding meshes/tori in faulty crossed cubes
• Regular connected bipancyclic spanning subgraphs of hypercubes
• Conditional connectivity
• EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE

This page was built for publication: Multiple regular graph embeddings into a hypercube with unbounded expansion