IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i4d10.1007_s10878-019-00441-x.html
   My bibliography  Save this article

Fractional matching preclusion of the restricted HL-graphs

Author

Listed:
  • Shunzhe Zhang

    (Hubei University)

  • Huiqing Liu

    (Hubei University)

  • Dong Li

    (Hubei University)

  • Xiaolan Hu

    (Central China Normal University)

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.

Suggested Citation

  • Shunzhe Zhang & Huiqing Liu & Dong Li & Xiaolan Hu, 2019. "Fractional matching preclusion of the restricted HL-graphs," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1143-1154, November.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00441-x
    DOI: 10.1007/s10878-019-00441-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00441-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-019-00441-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yan Liu & Weiwei Liu, 2017. "Fractional matching preclusion of graphs," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 522-533, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Huiqing & Zhang, Ruiting & Zhang, Shunzhe, 2022. "On the global strong resilience of fault Hamiltonian graphs," Applied Mathematics and Computation, Elsevier, vol. 418(C).
    2. Yu Luan & Mei Lu & Yi Zhang, 2022. "The fractional matching preclusion number of complete n-balanced k-partite graphs," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1323-1329, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu Luan & Mei Lu & Yi Zhang, 2022. "The fractional matching preclusion number of complete n-balanced k-partite graphs," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1323-1329, September.
    2. Yan Liu & Mengxia Lei & Xueli Su, 2020. "Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 59-68, July.
    3. Ruizhi Lin & Heping Zhang, 2020. "Fractional matching preclusion number of graphs and the perfect matching polytope," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 915-932, April.
    4. Liu, Huiqing & Zhang, Ruiting & Zhang, Shunzhe, 2022. "On the global strong resilience of fault Hamiltonian graphs," Applied Mathematics and Computation, Elsevier, vol. 418(C).
    5. Chang, Caibing & Li, Xianfu & Liu, Yan, 2023. "Integer k-matching preclusion of twisted cubes and (n,s)-star graphs," Applied Mathematics and Computation, Elsevier, vol. 440(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00441-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.