On embedding of a hypercube in a completely overlapping network

DOI10.1007/S00224-007-9036-3zbMATH Open1343.68023OpenAlexW1996976730MaRDI QIDQ2272202FDOQ2272202

Authors: Sanpawat Kantabutra, Jakarin Chawachat 

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9036-3

Recommendations

• On embedding complete graphs into hypercubes
• The embedding of graphs in hypercubes and cubic lattices
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• On the complexity of the embedding problem for hypercube related graphs
• On the net-embeddability of graphs
• On scale embeddings of graphs into hypercubes
• Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
• Embedding star networks into hypercubes
• An optimal embedding of cycles into incomplete hypercubes

zbMATH Keywords

hypercubenetwork embeddingoverlapping network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• Optimal numberings and isoperimetric problems on graphs
• On embedding rectangular grids in hypercubes
• Embedding star networks into hypercubes

Cited In (1)

• Embedding of elementary net into gap of nets

This page was built for publication: On embedding of a hypercube in a completely overlapping network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272202)