Conditional strong matching preclusion of the pancake graph. Issue 1 (2nd January 2023)

• Record Type: Journal Article
• Authors: Abdallah, Mohamad; Cheng, Eddie
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 38:Issue 1(2023)
• Page Start: 1
• Page End: 13
• Publication Date: 2023-01-02
• Subjects: Matching preclusion -- pancake graph; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2022.2066102
• Languages: English
• ISSNs: 1744-5760

Abstract

ABSTRACT: The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this article, we find the conditional strong matching preclusion number for the pancake graph.