Embedding of recursive circulants into certain necklace graphs
From MaRDI portal
Publication:2516514
DOI10.1007/s11786-015-0232-2zbMath1317.05128OpenAlexW1193590959MaRDI QIDQ2516514
T. M. Rajalaxmi, R. Sundara Rajan, N. Parthiban
Publication date: 3 August 2015
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-015-0232-2
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embeddings of circulant networks
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding of hypercubes into necklace, windmill and snake graphs
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- Embedding meshes/tori in faulty crossed cubes
- Path embedding in star graphs
- Exact wirelength of hypercubes on a grid
- The cyclic cutwidth of trees
- An edge-isoperimetric problem for powers of the Petersen graph
- Recursive circulants and their embeddings among hypercubes
- Embedding trees in recursive circulants
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- The congestion of \(n\)-cube layout on a rectangular grid
- Hamiltonian decomposition of recursive circulant graphs
- The super-connected property of recursive circulant graphs
- Complete path embeddings in crossed cubes
- Embedding of cycles and wheels into arbitrary trees
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
