Conditional strong matching preclusion of the pancake graph
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 verte...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2023
|
| Online Access: | http://hdl.handle.net/11675/10925 http://www.scopus.com/inward/record.url?scp=85128718587&partnerID=8YFLogxK |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!