Fractional matching preclusion of graphs

Yan Liu () and Weiwei Liu
Additional contact information
Yan Liu: South China Normal University
Weiwei Liu: South China Normal University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 2, No 15, 522-533

Abstract: Abstract Let F be an edge subset and $$F^{\prime }$$ F ′ a subset of edges and vertices of a graph G. If $$G-F$$ G - F and $$G-F^{\prime }$$ G - F ′ have no fractional perfect matchings, then F is a fractional matching preclusion (FMP) set and $$F^{\prime }$$ F ′ is a fractional strong MP (FSMP) set of G. The FMP (FSMP) number of G is the minimum size of FMP (FSMP) sets of G. In this paper, the FMP number and the FSMP number of Petersen graph, complete graphs and twisted cubes are obtained, respectively.

Keywords: Fractional perfect matching; Fractional strong matching preclusion number; Petersen graph; Complete graphs; Twisted cubes (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0077-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:34:y:2017:i:2:d:10.1007_s10878-016-0077-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0077-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().