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

DOI10.7155/JGAA.00562MaRDI QIDQ5084683zbMATH OpenOpenAlexFDO

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

Publication date 28 June 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• Wirelength of embedding complete multipartite graphs into certain graphs
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Wirelength of hypercubes into certain trees
• Exact wirelength of hypercube layout on k-cube necklace
• Embedding of hypercubes into necklace, windmill and snake graphs

Cites work

• A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
• An edge-isoperimetric problem for powers of the Petersen graph
• An optimal embedding of cycles into incomplete hypercubes
• Cycles embedding in folded hypercubes with conditionally faulty vertices
• Dense sets and embedding binary trees into hypercubes
• Distance-preserving subgraphs of hypercubes
• Embedding complete multipartite graphs into certain trees
• Embedding meshes into locally twisted cubes
• Embeddings Between Hypercubes and Hypertrees
• Exact wirelength of hypercubes on a grid
• Graph theory
• Handbook of graph theory
• Handbook of product graphs
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Improved bound for dilation of an embedding onto circulant networks
• Isometric embedding in products of complete graphs
• Linear layout of locally twisted cubes
• Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• Turán graphs and the number of colorings
• Wirelength of embedding complete multipartite graphs into certain graphs

Cited in

(7)

• Embedding the incomplete hypercube in books
• Wirelength of embedding complete multipartite graphs into certain graphs
• An asymptotic relation between the wirelength of an embedding and the Wiener index
• Minimum Linear Arrangement of Generalized Sierpinski Graphs
• Optimal layout of embedding onto folded hypercubes
• Embedding crossed cube into diverse product graphs and tree-derived architectures
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures

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

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