Recursive circulants and their embeddings among hypercubes

DOI10.1016/S0304-3975(00)00176-6zbMath0945.68003OpenAlexW2054041441WikidataQ127683722 ScholiaQ127683722MaRDI QIDQ1575703

N. Delaunay

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00176-6

zbMATH Keywords

embeddingdiameterconnectivityHamiltonian propertyrouting algorithmcirculant graphmulticomputer networkinterconnection structure

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (38)

Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Hamiltonian properties on the class of hypercube-like networks ⋮ The super-connected property of recursive circulant graphs ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Embedding trees in recursive circulants ⋮ Wirelength of embedding complete multipartite graphs into certain graphs ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Rainbow connections of graphs: a survey ⋮ Conditional diagnosability of component-composition graphs under the PMC model ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ Diagnosability of multigraph composition networks ⋮ The (strong) rainbow connection numbers of Cayley graphs on abelian groups ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ A fast fault-identification algorithm for bijective connection graphs using the PMC model ⋮ Edge-fault tolerance of hypercube-like networks ⋮ A survey on Knödel graphs. ⋮ Strong matching preclusion ⋮ K-restricted edge connectivity for some interconnection networks ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ The bicube: an interconnection of two hypercubes ⋮ Edge-pancyclicity of recursive circulants ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ Unnamed Item ⋮ Fault-tolerant panconnectivity of augmented cubes ⋮ Maximum induced subgraph of a recursive circulant ⋮ Survey on path and cycle embedding in some networks ⋮ Hamiltonian properties on a class of circulant interconnection networks ⋮ Pancyclicity of recursive circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding trees in recursive circulants
• On Group Graphs and Their Fault Tolerance
• Generalized de Bruijn digraphs
• Minimal broadcast networks
• Efficient Embeddings of Trees in Hypercubes
• The twisted N-cube with application to multiprocessing
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices
• A general class of invulnerable graphs

This page was built for publication: Recursive circulants and their embeddings among hypercubes