Matching preclusion number of graphs
Combinatorics
2018-09-03 v1
Abstract
The \emph{matching preclusion number} of a graph , denoted by , is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we first give some sharp upper and lower bounds of matching preclusion number. Next, graphs with large and small matching preclusion number are characterized, respectively. In the end, we investigate some extremal problems and the Nordhaus-Gaddum-type relations on matching preclusion number.
Keywords
Cite
@article{arxiv.1808.10443,
title = {Matching preclusion number of graphs},
author = {Zhao Wang and Yaping Mao and Eddie Cheng and Jinyu Zou},
journal= {arXiv preprint arXiv:1808.10443},
year = {2018}
}
Comments
23 pages