IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i10p941-d275263.html
   My bibliography  Save this article

Matching Extendabilities of G = C m ∨ P n

Author

Listed:
  • Zhi-hao Hui

    (School of Mathematics and Statistics Science, Pingdingshan University, Pingdingshan 467000, China)

  • Yu Yang

    (School of Computer Science, Pingdingshan University, Pingdingshan 467000, China
    School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai 200240, China)

  • Hua Wang

    (College of Software, Nankai University, Tianjin 300071, China
    Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA 30460, USA)

  • Xiao-jun Sun

    (School of Electrical and Mechanical Engineering, Pingdingshan University, Pingdingshan 467000, China)

Abstract

A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G . The induced-matching extendability and bipartite-matching extendability of graphs have been of interest. By letting G = C m ∨ P n ( m ≥ 3 and n ≥ 1 ) be the graph join of C m (the cycle with m vertices) and P n (the path with n vertices) contains a perfect matching, we find necessary and sufficient conditions for G to be induced-matching extendable and bipartite-matching extendable.

Suggested Citation

  • Zhi-hao Hui & Yu Yang & Hua Wang & Xiao-jun Sun, 2019. "Matching Extendabilities of G = C m ∨ P n," Mathematics, MDPI, vol. 7(10), pages 1-9, October.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:10:p:941-:d:275263
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/10/941/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/10/941/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yichao Chen & Yan Yang, 2017. "The thickness of the complete multipartite graphs and the join of graphs," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 194-202, 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:gam:jmathe:v:7:y:2019:i:10:p:941-:d:275263. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.