Embedding trees in recursive circulants
Discrete Applied Mathematics
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
Hamiltonian decomposition of recursive circulant graphs
Discrete Mathematics
Recursive circulants and their embeddings among hypercubes
Theoretical Computer Science
Pancyclicity of recursive circulant graphs
Information Processing Letters
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Edge-pancyclicity of recursive circulants
Information Processing Letters
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Cycle Embedding on the Möbius Cube with Both Faulty Nodes and Faulty Edges
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Graph Theory With Applications
Graph Theory With Applications
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Vertex-bipancyclicity of the generalized honeycomb tori
Computers & Mathematics with Applications
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Information Processing Letters
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Panconnectivity of Cartesian product graphs
The Journal of Supercomputing
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
Information and Computation
Vulnerability of super edge-connected networks
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper, we investigate a problem on embedding paths into recursive circulant G(2^m,4) with faulty elements (vertices and/or edges) and show that each pair of vertices in recursive circulant G(2^m,4), m=3, are joined by a fault-free path of every length from m+1 to |V(G(2^m,4)@?F)|-1 inclusive for any fault set F with |F|@?m-3. The bound m-3 on the number of acceptable faulty elements is the maximum possible. Moreover, recursive circulant G(2^m,4) has a fault-free cycle of every length from 4 to |V(G(2^m,4)@?F)| inclusive excluding 5 passing through an arbitrary fault-free edge for any fault set F with |F|@?m-3.