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!
|
| _version_ | 1832548003103113216 |
|---|---|
| author | Yalan Li Shumin Zhang Chengfu Ye |
| author_facet | Yalan Li Shumin Zhang Chengfu Ye |
| author_sort | Yalan Li |
| collection | DOAJ |
| description | 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 conditional matching preclusion number. Next, the graphs with large and small conditional matching preclusion numbers are characterized, respectively. In the end, we investigate some extremal problems on conditional matching preclusion number. |
| format | Article |
| id | doaj-art-9d6241109d7544cf9dbcc1bbd40446ef |
| institution | Kabale University |
| issn | 1607-887X |
| language | English |
| publishDate | 2023-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-9d6241109d7544cf9dbcc1bbd40446ef2025-02-03T06:42:38ZengWileyDiscrete Dynamics in Nature and Society1607-887X2023-01-01202310.1155/2023/5571724Conditional Matching Preclusion Number of GraphsYalan Li0Shumin Zhang1Chengfu Ye2Qinghai Normal UniversitySchool of Mathematics and StatistisSchool of Mathematics and StatistisThe 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 conditional matching preclusion number. Next, the graphs with large and small conditional matching preclusion numbers are characterized, respectively. In the end, we investigate some extremal problems on conditional matching preclusion number.http://dx.doi.org/10.1155/2023/5571724 |
| spellingShingle | Yalan Li Shumin Zhang Chengfu Ye Conditional Matching Preclusion Number of Graphs Discrete Dynamics in Nature and Society |
| title | Conditional Matching Preclusion Number of Graphs |
| title_full | Conditional Matching Preclusion Number of Graphs |
| title_fullStr | Conditional Matching Preclusion Number of Graphs |
| title_full_unstemmed | Conditional Matching Preclusion Number of Graphs |
| title_short | Conditional Matching Preclusion Number of Graphs |
| title_sort | conditional matching preclusion number of graphs |
| url | http://dx.doi.org/10.1155/2023/5571724 |
| work_keys_str_mv | AT yalanli conditionalmatchingpreclusionnumberofgraphs AT shuminzhang conditionalmatchingpreclusionnumberofgraphs AT chengfuye conditionalmatchingpreclusionnumberofgraphs |