Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees

DOI10.3233/FI-2021-2003MaRDI QIDQ4989174zbMATH OpenOpenAlexFDO

Authors Micheal Arockiaraj, J. Nancy Delaila, Jessie Abraham

Publication date 21 May 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2021-2003

zbMATH Keywords

balanced complete t-partite graphCartesian productembeddingwirelength

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Wirelength of embedding complete multipartite graphs into certain graphs
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embedding complete multipartite graphs into certain trees

Cites work

• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embedding ladders and caterpillars into the hypercube
• Exact wirelength of hypercubes on a grid
• scientific article; zbMATH DE number 3946174 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• Layout of embedding locally twisted cube into the extended theta mesh topology
• Linear 3-arboricity of the balanced complete multipartite graphs
• Node set optimization problem for complete Josephus cubes
• On crossing numbers of complete tripartite and balanced complete multipartite graphs
• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Ramsey numbers in complete balanced multipartite graphs. II: Size numbers
• The congestion of \(n\)-cube layout on a rectangular grid
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Wirelength of embedding complete multipartite graphs into certain graphs

Cited in

(10)

• Characterization of the congestion lemma on layout computation
• Wirelength of embedding complete multipartite graphs into certain graphs
• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles
• An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
• On the binary locating-domination number of regular and strongly-regular graphs
• Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
• Embedding of extended Sierpinski networks \(S^{++}(k, m)\) into certain trees

This page was built for publication: Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees

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