Embedding of hypercubes into necklace, windmill and snake graphs
DOI10.1016/J.IPL.2012.03.006zbMATH Open1243.68229OpenAlexW2025669150MaRDI QIDQ436587FDOQ436587
Indra Rajasingh, R. Sundara Rajan, Bharati Rajan
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.006
Recommendations
- The embedding of graphs in hypercubes and cubic lattices
- On embedding complete graphs into hypercubes
- Embedding hypercubes, rings, and odd graphs into hyper-stars
- Embedding of recursive circulants into certain necklace graphs
- scientific article; zbMATH DE number 1138195
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- scientific article
- On Polyhedral Embeddings of Cubic Graphs
- On scale embeddings of graphs into hypercubes
- On the complexity of the embedding problem for hypercube related graphs
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Mathematical problems of computer architecture (68M07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embedding meshes into locally twisted cubes
- Path embedding in star graphs
- Title not available (Why is that?)
- Embedding the incomplete hypercube in books
- Exact wirelength of hypercubes on a grid
- An edge-isoperimetric problem for powers of the Petersen graph
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- The congestion of \(n\)-cube layout on a rectangular grid
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Embedding of cycles and wheels into arbitrary trees
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- The cyclic cutwidth of trees
- Embeddings of circulant networks
- Efficient embeddings of grids into grids
- Optimal embeddings of generalized ladders into hypercubes
- Embedding complete trees into the hypercube
- Embedding of tori and grids into twisted cubes
- Embedding meshes/tori in faulty crossed cubes
- On embeddings of snarks in the torus
- Title not available (Why is that?)
- Complete path embeddings in crossed cubes
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Efficient embeddings of ternary trees into hypercubes.
- Embedding meshes into crossed cubes
- Dense sets and embedding binary trees into hypercubes
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Embedding of meshes in Möbius cubes
Cited In (14)
- Node set optimization problem for complete Josephus cubes
- Title not available (Why is that?)
- A linear time algorithm for embedding hypercube into cylinder and torus
- Maximum incomplete recursive circulants in graph embeddings
- Embedding Wheel - like Networks
- Exact wirelength of hypercube and enhanced hypercube layout on regular caterpillars
- Results on Total Restrained Domination number and subdivision number for certain graphs
- Characterization of the congestion lemma on layout computation
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- Bothway embedding of circulant network into grid
- An extension of locating-total domination problem and its complexity
- Embedding of recursive circulants into certain necklace graphs
- Exact wirelength of hypercube layout on \(k\)-cube necklace
- Embedding hypercubes, rings, and odd graphs into hyper-stars
This page was built for publication: Embedding of hypercubes into necklace, windmill and snake graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436587)
