Fractional matching preclusion of the restricted HL-graphs

Shunzhe Zhang, Huiqing Liu, Dong Li and Xiaolan Hu ()
Additional contact information
Shunzhe Zhang: Hubei University
Huiqing Liu: Hubei University
Dong Li: Hubei University
Xiaolan Hu: Central China Normal University

Journal of Combinatorial Optimization, 2019, vol. 38, issue 4, No 10, 1143-1154

Abstract: Abstract The fractional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings, and the fractional strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion leaves a resulting graph with no fractional perfect matchings. In this paper, we determine these two numbers for the restricted HL-graphs.

Keywords: Fractional perfect matching; Fractional matching preclusion number; Fractional strong matching preclusion number; Restricted HL-graphs (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00441-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:38:y:2019:i:4:d:10.1007_s10878-019-00441-x

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

DOI: 10.1007/s10878-019-00441-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 ().