Conditional strong matching preclusion of the alternating group graph

Mohamad Abdallah; Eddie Cheng

doi:10.20429/tag.2019.060205

Conditional strong matching preclusion of the alternating group graph

Mohamad Abdallah
, Eddie Cheng

Mathematic and Natural Sciences

Research output: Contribution to journal › Article › peer-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 language	English
Article number	060205
Journal	Theory and Applications of Graphs
Volume	6
Issue number	2
DOIs	https://doi.org/10.20429/tag.2019.060205
State	Published - 2019

Access to Document

10.20429/tag.2019.060205

Cite this

@article{c7ebe683dc944cd686aeb45f22f93e9e,

title = "Conditional strong matching preclusion of the alternating group graph",

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.",

author = "Mohamad Abdallah and Eddie Cheng",

year = "2019",

doi = "10.20429/tag.2019.060205",

language = "English",

volume = "6",

journal = "Theory and Applications of Graphs",

issn = "2470-9859",

publisher = "Georgia Southern University",

number = "2",

}

TY - JOUR

T1 - Conditional strong matching preclusion of the alternating group graph

AU - Abdallah, Mohamad

AU - Cheng, Eddie

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85081995522

U2 - 10.20429/tag.2019.060205

DO - 10.20429/tag.2019.060205

M3 - Article

AN - SCOPUS:85081995522

SN - 2470-9859

VL - 6

JO - Theory and Applications of Graphs

JF - Theory and Applications of Graphs

IS - 2

M1 - 060205

ER -

Conditional strong matching preclusion of the alternating group graph

Abstract

Access to Document

Other files and links

Fingerprint

Cite this