Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
DOI10.1016/j.jcss.2016.01.003zbMath1338.68027OpenAlexW2298465770MaRDI QIDQ269484
Sun-Yuan Hsieh, Chia-Wen Cheng
Publication date: 18 April 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.01.003
interconnection networksCartesian product graphsedge-bipancyclicedge-pancyclicfault-tolerant embeddings
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new sufficient condition for hamiltonicity of graphs
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Fault-tolerant cycle-embedding of crossed cubes
- Survey on path and cycle embedding in some networks
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- On connectivity of the cartesian product of two graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant pancyclicity of augmented cubes
- Fault-tolerant cycle-embedding in alternating group graphs
- On embedding cycles into faulty twisted cubes
- Cycle embedding in star graphs with edge faults
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
- Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
- A general framework for developing adaptive fault-tolerant routing algorithms
- Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes
This page was built for publication: Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
