Recursive circulants and their embeddings among hypercubes
From MaRDI portal
Recommendations
Cites work
- A general class of invulnerable graphs
- Efficient Embeddings of Trees in Hypercubes
- Embedding trees in recursive circulants
- Generalized de Bruijn digraphs
- scientific article; zbMATH DE number 3725713 (Why is no real title available?)
- scientific article; zbMATH DE number 3733976 (Why is no real title available?)
- scientific article; zbMATH DE number 52889 (Why is no real title available?)
- scientific article; zbMATH DE number 1262801 (Why is no real title available?)
- Minimal broadcast networks
- On Group Graphs and Their Fault Tolerance
- Optimal Assignments of Numbers to Vertices
- Optimal numberings and isoperimetric problems on graphs
- The twisted N-cube with application to multiprocessing
Cited in
(50)- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- Edge-pancyclicity of recursive circulants
- Fault-tolerant panconnectivity of augmented cubes
- Maximum induced subgraph of a recursive circulant
- Survey on path and cycle embedding in some networks
- Multiplicative circulant networks. Topological properties and communication algorithms
- Decycling hypercubes
- A survey on Knödel graphs.
- Pancyclicity of recursive circulant graphs
- Embedding trees in recursive circulants
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
- Wirelength of embedding complete multipartite graphs into certain graphs
- Conditional diagnosability of component-composition graphs under the PMC model
- Cube-connected circulants: bisection width, Wiener and forwarding indices
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
- Hamiltonian properties on the class of hypercube-like networks
- The super-connected property of recursive circulant graphs
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups
- Edge-fault tolerance of hypercube-like networks
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Embedding of recursive circulants into certain necklace graphs
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Maximum incomplete recursive circulants in graph embeddings
- Recognizing recursive circulant graphs (extended abstract)
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- scientific article; zbMATH DE number 140108 (Why is no real title available?)
- scientific article; zbMATH DE number 165468 (Why is no real title available?)
- scientific article; zbMATH DE number 1262801 (Why is no real title available?)
- scientific article; zbMATH DE number 512930 (Why is no real title available?)
- scientific article; zbMATH DE number 1983295 (Why is no real title available?)
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
- Embedding of recursive circulant \(RC(2^{n},4)\) into circular necklace
- The bicube: an interconnection of two hypercubes
- Hamiltonian properties on a class of circulant interconnection networks
- On the symmetries of some classes of recursive circulant graphs
- Recursive cubes of rings as models for interconnection networks
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
- Diagnosability of multigraph composition networks
- Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements
- Strong matching preclusion
- Maximal diameter of integral circulant graphs
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- K-restricted edge connectivity for some interconnection networks
This page was built for publication: Recursive circulants and their embeddings among hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575703)
