共 50 条
Conditional strong matching preclusion of the pancake graph
被引:0
|作者:
Abdallah, Mohamad
[1
]
Cheng, Eddie
[2
]
机构:
[1] Amer Univ Kuwait, Dept Math & Nat Sci, Safat, Kuwait
[2] Oakland Univ, Dept Math & Stat, Rochester, MI USA
关键词:
Matching preclusion;
pancake graph;
D O I:
10.1080/17445760.2022.2066102
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
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.
引用
收藏
页码:1 / 13
页数:13
相关论文