Fractional matching preclusion number of graphs
Combinatorics
2019-09-18 v1
Abstract
The \emph{fractional matching preclusion number} of a graph , denoted by , is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings. In this paper, we first give some sharp upper and lower bounds of fractional matching preclusion number. Next, graphs with large and small fractional matching preclusion number are characterized, respectively. In the end, we investigate some extremal problems on fractional matching preclusion number.
Cite
@article{arxiv.1909.07878,
title = {Fractional matching preclusion number of graphs},
author = {Jinyu Zou and Yaping Mao and Zhao Wang and Eddie Cheng},
journal= {arXiv preprint arXiv:1909.07878},
year = {2019}
}
Comments
17 pages, 4 figures. arXiv admin note: text overlap with arXiv:1808.10443