IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i1d10.1007_s10878-021-00766-6.html
   My bibliography  Save this article

A note on maximum fractional matchings of graphs

Author

Listed:
  • Tianlong Ma

    (Xiamen University)

  • Eddie Cheng

    (Oakland University)

  • Yaping Mao

    (Qinghai Normal University
    Academy of Plateau Science and Sustainability)

  • Xu Wang

    (Qinghai Normal University)

Abstract

A fractional matching of a graph G is a function f giving each edge a number in [0, 1] so that $$\sum _{e\in \Gamma _G (v)} f(e)\le 1 $$ ∑ e ∈ Γ G ( v ) f ( e ) ≤ 1 for each $$v \in V(G)$$ v ∈ V ( G ) , where $$\Gamma _G (v)$$ Γ G ( v ) is the set of edges incident to v in G. The fractional matching number of G, denoted by $$\mu _f(G)$$ μ f ( G ) , is the maximum of $$\sum _{e\in E(G)} f(e)$$ ∑ e ∈ E ( G ) f ( e ) over all fractional matchings f. A fractional matching f of G is called a maximum fractional matching if $$\sum _{e\in E(G)} f(e)=\mu _f(G)$$ ∑ e ∈ E ( G ) f ( e ) = μ f ( G ) . In this paper, as a supplement of known results in Liu et al. (J Comb Optim 40:59–68, 2020), we further study the maximum fractional matching, and give some sufficient and necessary conditions to characterize the maximum fractional matching. Furthermore, as applications, the sharp lower bounds of the fractional matching number for Cartesian product, strong product, lexicographic product and direct product are obtained.

Suggested Citation

  • Tianlong Ma & Eddie Cheng & Yaping Mao & Xu Wang, 2022. "A note on maximum fractional matchings of graphs," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 253-264, January.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:1:d:10.1007_s10878-021-00766-6
    DOI: 10.1007/s10878-021-00766-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00766-6
    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-021-00766-6?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 & 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.
    Full references (including those not matched with items on IDEAS)

    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.

      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:43:y:2022:i:1:d:10.1007_s10878-021-00766-6. 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.