Conditional strong matching preclusion of the alternating group graph

Mohamad Abdallah, Eddie Cheng

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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.

Original languageEnglish
Article number060205
JournalTheory and Applications of Graphs
Volume6
Issue number2
DOIs
StatePublished - 2019

Fingerprint

Dive into the research topics of 'Conditional strong matching preclusion of the alternating group graph'. Together they form a unique fingerprint.

Cite this