Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges

DOI10.1016/J.JCSS.2016.01.003MaRDI QIDQ269484zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

interconnection networksCartesian product graphsedge-bipancyclicedge-pancyclicfault-tolerant embeddings

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 4173021 (Why is no real title available?)
• scientific article; zbMATH DE number 47528 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• A general framework for developing adaptive fault-tolerant routing algorithms
• A new sufficient condition for hamiltonicity of graphs
• Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
• Cycle embedding in star graphs with edge faults
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Fault-tolerant cycle-embedding in alternating group graphs
• Fault-tolerant cycle-embedding of crossed cubes
• Fault-tolerant pancyclicity of augmented cubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Linear array and ring embeddings in conditional faulty hypercubes
• On connectivity of the cartesian product of two graphs
• On embedding cycles into faulty twisted cubes
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Survey on path and cycle embedding in some networks

Cited in

(2)

• Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
• Minimum \(k\)-critical bipartite graphs

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)