Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
From MaRDI portal
Publication:2474073
DOI10.1016/j.tcs.2007.10.016zbMath1134.68044OpenAlexW2064966517MaRDI QIDQ2474073
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.016
embeddingfault toleranceringsinterconnection networksedge-pancyclicpanconnectedlinear arraysrecursive circulants
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (15)
Vertex-bipancyclicity of the generalized honeycomb tori ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes ⋮ Vulnerability of super edge-connected networks ⋮ Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Edge-fault-tolerant vertex-pancyclicity of augmented cubes ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes ⋮ Vertex-pancyclicity of augmented cubes with maximal faulty edges ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ Cycles passing through a prescribed path in a hypercube with faulty edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On ring embedding in hypercubes with faulty nodes and links
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Fault-tolerant cycle-embedding of crossed cubes
- Edge-pancyclicity of recursive circulants
- Recursive circulants and their embeddings among hypercubes
- Pancyclicity of recursive circulant graphs
- Embedding trees in recursive circulants
- Hamiltonian decomposition of recursive circulant graphs
- Panconnectivity of locally twisted cubes
- On embedding cycles into faulty twisted cubes
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Algorithms and Computation
This page was built for publication: Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)