An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength

DOI10.7155/jgaa.00562zbMath1489.05149OpenAlexW3175904179MaRDI QIDQ5084683

T. M. Rajalaxmi, A. Arul Shantrinal, R. Sundara Rajan, Sandi Klavžar

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00562

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Minimum Linear Arrangement of Generalized Sierpinski Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles embedding in folded hypercubes with conditionally faulty vertices
• Isometric embedding in products of complete graphs
• Dense sets and embedding binary trees into hypercubes
• Embedding meshes into locally twisted cubes
• Exact wirelength of hypercubes on a grid
• An edge-isoperimetric problem for powers of the Petersen graph
• An optimal embedding of cycles into incomplete hypercubes
• Wirelength of embedding complete multipartite graphs into certain graphs
• A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• Distance-preserving subgraphs of hypercubes
• Graph Theory
• Handbook of Graph Theory
• Turán Graphs and the Number of Colorings
• Embeddings Between Hypercubes and Hypertrees
• Improved Bound for Dilation of an Embedding onto Circulant Networks
• Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
• Embedding Complete Multipartite Graphs into Certain Trees
• Linear layout of locally twisted cubes

This page was built for publication: An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength