Conditional Matching Preclusion Number of Graphs

Yalan Li, Shumin Zhang, Chengfu Ye and Junwei Wang

Discrete Dynamics in Nature and Society, 2023, vol. 2023, 1-9

Abstract: 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.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ddns/2023/5571724.pdf (application/pdf)
http://downloads.hindawi.com/journals/ddns/2023/5571724.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:5571724

DOI: 10.1155/2023/5571724

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().