Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
DOI10.1016/J.JCSS.2016.01.003zbMATH Open1338.68027OpenAlexW2298465770MaRDI QIDQ269484FDOQ269484
Authors: Chia-Wen Cheng, Sun-Yuan Hsieh 
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
Recommendations
- Bipancyclic properties of faulty hypercubes
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Pancyclicity of restricted hypercube-like networks under the conditional fault model
- Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
interconnection networksCartesian product graphsedge-bipancyclicedge-pancyclicfault-tolerant embeddings
Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Survey on path and cycle embedding in some networks
- On connectivity of the cartesian product of two graphs
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fault-tolerant cycle-embedding of crossed cubes
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- 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
- Title not available (Why is that?)
- Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
- Title not available (Why is that?)
- 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
- A new sufficient condition for hamiltonicity of graphs
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Cited In (2)
This page was built for publication: Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269484)
