Embedding of hypercube into fractal cubic network
From MaRDI portal
Publication:6656779
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1082415 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- A linear time algorithm for embedding Christmas trees into certain trees
- A survey of the theory of hypercube graphs
- An edge-isoperimetric problem for powers of the Petersen graph
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- Dense sets and embedding binary trees into hypercubes
- Distance-preserving subgraphs of hypercubes
- Embedding augmented cube into certain trees and windmill graphs
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Exact wirelength of hypercubes on a grid
- Isometric embedding in products of complete graphs
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
- Metric graph theory and geometry: a survey
- Minimum Linear Arrangement of Generalized Sierpinski Graphs
- 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
- Wirelength of embedding complete multipartite graphs into certain 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)