IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0285603.html
   My bibliography  Save this article

Applications of maximum matching by using bipolar fuzzy incidence graphs

Author

Listed:
  • Fahad Ur Rehman
  • Tabasam Rashid
  • Muhammad Tanveer Hussain

Abstract

The extension of bipolar fuzzy graph is bipolar fuzzy incidence graph (BFIG) which gives the information regarding the effect of vertices on the edges. In this paper, the concept of matching in bipartite BFIG and also for BFIG is introduced. Some results and theorems of fuzzy graphs are also extended in BFIGs. The number of operations in BFIGs such as augmenting paths, matching principal numbers, relation between these principal numbers and maximum matching principal numbers are being investigated which are helpful in the selection of maximum most allied applicants for the job and also to get the maximum outcome with minimum loss (due to any controversial issues among the employees of a company). Some characteristics of maximum matching principal numbers in BFIG are explained which are helpful for solving the vertex and incidence pair fuzzy maximization problems. Lastly, obtained maximum matching principal numbers by using the matching concept to prove its applicability and effectiveness for the applications in bipartite BFIG and also for the BFIG.

Suggested Citation

  • Fahad Ur Rehman & Tabasam Rashid & Muhammad Tanveer Hussain, 2023. "Applications of maximum matching by using bipolar fuzzy incidence graphs," PLOS ONE, Public Library of Science, vol. 18(8), pages 1-17, August.
    • Handle: RePEc:plo:pone00:0285603
    DOI: 10.1371/journal.pone.0285603
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0285603
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0285603&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0285603?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
    ---><---

    More about this item

    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:plo:pone00:0285603. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.