Embedding complete multi-partite graphs into Cartesian product of paths and cycles
DOI10.5614/ejgta.2021.9.2.21zbMath1482.05238arXiv1901.07717OpenAlexW3206528106MaRDI QIDQ5061707
A. Arul Shantrinal, T. M. Rajalaxmi, R. Sundara Rajan, Weibei Fan, Jianxi Fan
Publication date: 14 March 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07717
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- Constructing completely independent spanning trees in crossed cubes
- Embedding of tori and grids into twisted cubes
- Embedding meshes/tori in faulty crossed cubes
- Path embedding in star graphs
- The hyper-Wiener index of graph operations
- 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
- Wirelength of embedding complete multipartite graphs into certain graphs
- Minimum linear arrangement of chord graphs
- Embedding of Grids into Optimal Hypercubes
- Embedding Trees in a Hypercube is NP-Complete
- Embedding graphs onto the Supercube
- Embedding binary trees into crossed cubes
- Complete binary trees in folded and enhanced cubes
- A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
- Embedding of cycles and wheels into arbitrary trees
- Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
- Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
- An asymptotic relation between the wirelength of an embedding and the Wiener index
- Optimal Linear Ordering
- Algorithms and Computation
This page was built for publication: Embedding complete multi-partite graphs into Cartesian product of paths and cycles
