Complete binary trees in folded and enhanced cubes

DOI10.1002/net.20002zbMath1054.68098MaRDI QIDQ4474302

R. Usha Nandini, Sheshayya A. Choudum

Publication date: 4 August 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20002

zbMATH Keywords

network; hypercube; graph; embedding; binary tree; enhanced cube; folded cube

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Vertex-fault-tolerant cycles embedding on enhanced hypercube networks, Minimum average congestion of enhanced and augmented hypercubes into complete binary trees, Complete binary trees embeddings in Möbius cubes, Some results on topological properties of folded hypercubes, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, Wirelength of hypercubes into certain trees, Wirelength of embedding complete multipartite graphs into certain graphs, The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube, Fault-tolerant cycles embedding in folded hypercubes

Cites Work

• Unnamed Item