Embedding of hypercube into fractal cubic network
From MaRDI portal
Publication:6656779
DOI10.1142/S0129626424500087MaRDI QIDQ6656779
Remi Mariam Reji, R. Sundara Rajan, N. Sadagopan, Ismail Naci Cangül
Publication date: 3 January 2025
Published in: Parallel Processing Letters (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- Isometric embedding in products of complete graphs
- Dense sets and embedding binary trees into hypercubes
- Exact wirelength of hypercubes on a grid
- A survey of the theory of hypercube graphs
- An edge-isoperimetric problem for powers of the Petersen graph
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Wirelength of embedding complete multipartite graphs into certain graphs
- Distance-preserving subgraphs of hypercubes
- A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
- Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path
- Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
- Minimum Linear Arrangement of Generalized Sierpinski Graphs
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- Embedding augmented cube into certain trees and windmill graphs
This page was built for publication: Embedding of hypercube into fractal cubic network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656779)
