Conditional Matching Preclusion Number of Graphs
The conditional matching preclusion number of a graph G, denoted by mp1G, is the minimum number of edges whose deletion results in the graph with no isolated vertices that has neither perfect matching nor almost-perfect matching. In this paper, we first give some sharp upper and lower bounds of cond...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2023/5571724 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|