A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
On the problem of sorting burnt pancakes
Discrete Applied Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Theoretical Computer Science - Special issue: Genome informatics
On Sorting by Prefix Reversals and the Diameter of Pancake Networks
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
Embedding hypercubes into pancake, cycle prefix and substring reversal networks
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs
IEICE - Transactions on Information and Systems
Graph Theory
Conditional matching preclusion sets
Information Sciences: an International Journal
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science
Fault-tolerant routing in burnt pancake graphs
Information Processing Letters
Matching preclusion for k-ary n-cubes
Discrete Applied Mathematics
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
Discrete Applied Mathematics
Matching preclusion and conditional matching preclusion for regular interconnection networks
Discrete Applied Mathematics
| Hi-index | 0.04 |
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings, and the conditional matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph with no isolated vertices that has neither perfect matchings nor almost perfect matchings. In this paper, we find these two numbers for the burnt pancake graphs and show that every optimal (conditional) matching preclusion set is trivial.