IDEAS home Printed from https://ideas.repec.org/a/wsi/nmncxx/v20y2024i01ns179300572450008x.html
   My bibliography  Save this article

Containers and Spanning Containers in Fuzzy Graphs with Application to Human Trafficking

Author

Listed:
  • Shanookha Ali

    (Department of H&S, CVR College of Engineering, Hyderabad 501510, India)

  • Sunil Mathew

    (��Department of Mathematics, National Institute of Technology, Calicut 673601, India)

  • J. N. Mordeson

    (��Department of Mathematics, Creighton University 68178, USA)

Abstract

Containers in fuzzy graphs are studied in this paper. A container in a graph is a family of internally disjoint paths between a pair of vertices. Equivalently, a container in a fuzzy graph is a collection of internally disjoint strongest paths. Strongest paths often provide maximum contribution to a network’s traffic flow. Therefore analysis of strongest paths and containers helps examining the dynamics and complexities of networks. Apart from certain structural properties of containers, two classic results on graph degrees are also generalized to fuzzy setup. Spanning containers of blocks, fuzzy trees and locamin cycles are discussed. An algorithm to identify the maximum and minimum capacity of containers and an application related to human trafficking are also proposed.

Suggested Citation

  • Shanookha Ali & Sunil Mathew & J. N. Mordeson, 2024. "Containers and Spanning Containers in Fuzzy Graphs with Application to Human Trafficking," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 20(01), pages 103-128, March.
    • Handle: RePEc:wsi:nmncxx:v:20:y:2024:i:01:n:s179300572450008x
    DOI: 10.1142/S179300572450008X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S179300572450008X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S179300572450008X?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.

    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:wsi:nmncxx:v:20:y:2024:i:01:n:s179300572450008x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/nmnc/nmnc.shtml .

    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.