IDEAS home Printed from https://ideas.repec.org/a/ibn/jmrjnl/v11y2019i4p32.html
   My bibliography  Save this article

Fractional Strong Matching Preclusion of Split-Star Networks

Author

Listed:
  • Ping Han
  • Yuzhi Xiao
  • Chengfu Ye
  • He Li

Abstract

The matching preclusion number of graph G is the minimum size of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. Let F be an edge subset and F′ be a subset of edges and vertices of a graph G. If G − F and G − F′ have no fractional matching preclusion, then F is a fractional matching preclusion (FMP) set, and F ′is a fractional strong matching preclusion (FSMP) set of G. The FMP (FSMP) number of G is the minimum number of FMP (FSMP) set of G. In this paper, we study fractional matching preclusion number and fractional strong matching preclusion number of split-star networks. Moreover, We categorize all the optimal fractional strong matching preclusion sets of split-star networks.

Suggested Citation

  • Ping Han & Yuzhi Xiao & Chengfu Ye & He Li, 2019. "Fractional Strong Matching Preclusion of Split-Star Networks," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 11(4), pages 32-42, August.
    • Handle: RePEc:ibn:jmrjnl:v:11:y:2019:i:4:p:32
    as

    Download full text from publisher

    File URL: http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/40138/41283
    Download Restriction: no
    File URL: http://www.ccsenet.org/journal/index.php/jmr/article/view/0/40138
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    perfect matching; fractional matching preclusion number; fractional strong matching preclusion number; split-star networks;
    All these keywords.

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    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:ibn:jmrjnl:v:11:y:2019:i:4:p:32. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    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.