Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
From MaRDI portal
Publication:4989174
DOI10.3233/FI-2021-2003zbMath1482.68169OpenAlexW3123013334MaRDI QIDQ4989174
J. Nancy Delaila, Micheal Arockiaraj, 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
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
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, Characterization of the congestion lemma on layout computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact wirelength of hypercubes on a grid
- Embedding ladders and caterpillars into the hypercube
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Ramsey numbers in complete balanced multipartite graphs. II: Size numbers
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- The congestion of \(n\)-cube layout on a rectangular grid
- Wirelength of embedding complete multipartite graphs into certain graphs
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- Node set optimization problem for complete Josephus cubes
- Layout of embedding locally twisted cube into the extended theta mesh topology
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
