Wirelength of embedding complete multipartite graphs into certain graphs

DOI10.1016/j.dam.2018.05.034zbMath1439.05162OpenAlexW2810638354WikidataQ129599249 ScholiaQ129599249MaRDI QIDQ2181259

G. Sethuraman, Jia-Bao Liu, R. Sundara Rajan, T. M. Rajalaxmi

Publication date: 18 May 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.034

zbMATH Keywords

cycleembeddingtoruspathcylinderwheelcongestioncirculant graphcomplete multipartite graphhypertreewirelength

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

An asymptotic relation between the wirelength of an embedding and the Wiener index ⋮ Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Wiener index via wirelength of an embedding ⋮ An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ Embedding Wheel - like Networks ⋮ On the optimal layout of balanced complete multipartite graphs into grids and tree related structures ⋮ Unnamed Item ⋮ Embedding algorithm of spined cube into grid structure and its wirelength computation ⋮ Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding of tori and grids into twisted cubes
• Embedding meshes/tori in faulty crossed cubes
• Embedding meshes into locally twisted cubes
• Path embedding in star graphs
• Exact wirelength of hypercubes on a grid
• Embedding the incomplete hypercube in books
• The cyclic wirelength of trees
• An edge-isoperimetric problem for powers of the Petersen graph
• Recursive circulants and their embeddings among hypercubes
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Embedding meshes into crossed cubes
• Minimum linear arrangement of chord graphs
• Complete binary trees in folded and enhanced cubes
• Embedding of cycles and wheels into arbitrary trees
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Optimal Linear Ordering

This page was built for publication: Wirelength of embedding complete multipartite graphs into certain graphs