Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees

DOI10.1016/j.disopt.2015.03.001zbMath1387.68176OpenAlexW2077129888MaRDI QIDQ1751113

Jasintha Quadras, Arul Jeya Shalini, Indra Rajasingh, Micheal Arockiaraj

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.03.001

zbMATH Keywords

embeddingCartesian productfolded hypercubesedge isoperimetric problem1-rooted complete binary treessibling trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees ⋮ Layout of embedding locally twisted cube into the extended theta mesh topology ⋮ On linear layout of bicube and construction of optimal incomplete bicube ⋮ On the optimal layout of balanced complete multipartite graphs into grids and tree related structures ⋮ Linear layout of locally twisted cubes ⋮ Node set optimization problem for complete Josephus cubes ⋮ Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddings of circulant networks
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
• Linear wirelength of folded hypercubes
• Dense sets and embedding binary trees into hypercubes
• On reliability of the folded hypercubes
• Embedding of meshes in Möbius cubes
• On embedding subclasses of height-balanced trees in hypercubes
• Exact wirelength of hypercubes on a grid
• The cyclic cutwidth of trees
• Embedding of binomial trees in hypercubes with link faults
• Embedding ladders and caterpillars into the hypercube
• An edge-isoperimetric problem for powers of the Petersen graph
• Wirelength of hypercubes into certain trees
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• The congestion of \(n\)-cube layout on a rectangular grid
• Efficient Embeddings of Trees in Hypercubes
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Complete binary trees in folded and enhanced cubes
• Embedding of cycles and wheels into arbitrary trees
• Optimal Assignments of Numbers to Vertices
• Optimal embeddings of generalized ladders into hypercubes
• Embedding complete trees into the hypercube
• Optimal dynamic embeddings of complete binary trees into hypercubes

This page was built for publication: Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees