We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Fractional Matching Preclusion for (n, k)-Star Graphs.
- Authors
Ma, Tianlong; Mao, Yaping; Cheng, Eddie; Wang, Jinling
- Abstract
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the FMP number and the FSMP number for (n, k)-star graphs. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.
- Subjects
FRACTIONAL calculus; STAR graphs (Graph theory); STATISTICAL matching; EDGES (Geometry); TOPOLOGY; DISTRIBUTED algorithms
- Publication
Parallel Processing Letters, 2018, Vol 28, Issue 4, pN.PAG
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626418500172