Skip to main content
SpringerLink
Log in

Max-flow min-cut theorem for directed fuzzy incidence networks

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Modern networks like the internet and data grids are rapidly evolving and quickly growing in size. The investigation and study of their dynamism and stability necessitate the use of graph-theoretic approaches. Fuzzification of the network is unavoidable in order to incorporate their vast size. This paper proposes a network model, namely directed fuzzy incidence network (DFIN), suitable for dealing with networks of extraneous flows and support. It is a special kind of directed fuzzy incidence graphs that are both node and edge capacitated. Transportation networks may be most successfully assessed when they are regarded as directed fuzzy incidence networks. This study also concentrates on legal flow, saturated and unsaturated arc, arc cut, and legal flow enhancing path in a directed fuzzy incidence network. Legal flow on a directed fuzzy incidence network is defined as a function on the arc set in such a way that the legal flow of an arc never exceeds the corresponding legal incidence strength of the arc. Moreover, it holds node capacity constraint as well as flow conservation constraint. It is shown that the resultant legal flow out of the source is equal to the resultant legal flow into the sink for any legal flow defined on the directed fuzzy incidence network. Also, it is proved that the value of a legal flow can be determined using any arc cut in the directed fuzzy incidence network. The relation between the value of a legal flow and any arc cut in the directed fuzzy incidence network is established and a necessary and sufficient condition for their equality is obtained. Moreover, an equivalent condition for a legal flow to become maximum is given using enhancing paths. The ultimate goal of the work is to provide a DFIN-analog of max-flow min-cut theorem in graph theory. In addition, the paper proposes an algorithm for determining maximum legal flow in a directed fuzzy incidence network and illustrates it with an application in transport of commodities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Akram, M.: Bipolar fuzzy graphs. Inf. Sci. 181, 5548–5564 (2011)

    MathSciNet  Google Scholar 

  2. Akram, M.: Interval-valued fuzzy line graphs. Neural Comput. Appl. 21, 145–150 (2012)

    ADS  Google Scholar 

  3. Akram, M., Ahmad, U., Rukhsar, S., et al.: Complex Pythagorean fuzzy threshold graphs with application in petroleum replenishment. J. Appl. Math. Comput. 68, 2125–2150 (2022)

    MathSciNet  Google Scholar 

  4. Akram, M., Nawaz, H.S.: Algorithms for the computation of regular single-valued neutrosophic soft hypergraphs applied to supranational asian bodies. J. Appl. Math. Comput. 68, 4479–4506 (2022)

    MathSciNet  Google Scholar 

  5. Akram, M., Sarwar, M., Dedek, W.A.: Graphs for the Analysis of Bipolar Fuzzy Information, vol. 401. Springer, Berlin (2021)

    Google Scholar 

  6. Akram, M., Saleem, D., Davvaz, B.: Energy of double dominating bipolar fuzzy graphs. J. Appl. Math. Comput. 61, 219–2346 (2019)

    MathSciNet  Google Scholar 

  7. Artzner, P.H., Rado, R.: A theorem on flow in directed graphs. J. Lond. Math. Soc. 2–19(1), 187–191 (1979)

    MathSciNet  Google Scholar 

  8. Bhattacharya, A., Pal, M.: Fuzzy covering problem of fuzzy graphs and its application to investigate the Indian economy in new normal. J. Appl. Math. Comput. 68, 479–510 (2022)

    MathSciNet  PubMed  Google Scholar 

  9. Bhattacharya, P.: Some remarks on fuzzy graphs. Pattern Recogn. Lett. 6, 297–302 (1987)

    ADS  Google Scholar 

  10. Bhutani, K.R., Battou, A.: On M-strong fuzzy graphs. Inf. Sci. 155, 103–109 (2003)

    MathSciNet  Google Scholar 

  11. Bhutani, K.R., Rosenfeld, A.: Fuzzy end nodes in fuzzy graphs. Inf. Sci. 152, 323–326 (2003)

    MathSciNet  Google Scholar 

  12. Bhutani, K.R., Rosenfeld, A.: Strong arcs in fuzzy graphs. Inf. Sci. 152, 319–322 (2003)

    MathSciNet  Google Scholar 

  13. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, New York (1976)

    Google Scholar 

  14. Concas, A., Fenu, C., Reichel, L., Rodriguez, G., Zhang, Y.: Chained structure of directed graphs with applications to social and transportation networks. Appl. Netw. Sci. 7(1), 64 (2022)

    PubMed  PubMed Central  Google Scholar 

  15. Dinesh, T.: A study on graph structures, Incidence Algebras and their Fuzzy Analogues, Ph. D. Thesis. Kannur University, Kerala, India (2012)

  16. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)

    MathSciNet  Google Scholar 

  17. Gayathri, G., Mathew, S., Mordeson, J.N.: Directed fuzzy incidence: a model for illicit flow networks. Inf. Sci. 608, 1375–1400 (2022)

    Google Scholar 

  18. Gayathri, G., Mathew, S., Mordeson, J.N.: Connectivity of directed fuzzy incidence graphs applied to traffic networks. J. Appl. Math. Comput. 69, 3317–3336 (2023)

    MathSciNet  Google Scholar 

  19. Gayathri, G., Mathew, S., Mordeson, J.N.: Legal fuzzy incidence blocks and legal flow reduction sets with application to water distribution networks. Fuzzy Sets Syst. (Under Review)

  20. Kaufmann, A.: Introduction to the Theory of Fuzzy Sets. Academic Press Inc., Orlando (1973)

    Google Scholar 

  21. Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 2–17(3), 369–374 (1978)

    MathSciNet  Google Scholar 

  22. Mathew, S., Mordeson, J.N.: Connectivity concepts in fuzzy incidence graphs. Inf. Sci. 382, 326–333 (2017)

    MathSciNet  Google Scholar 

  23. Mathew, S., Mordeson, J.N.: Fuzzy endnodes in fuzzy incidence graphs. New Math. Nat. Comput. 13(1), 13–20 (2017)

    MathSciNet  Google Scholar 

  24. Mathew, S., Mordeson, J.N.: Fuzzy incidence blocks and their application in illegal migration problems. New Math. Natural Comput. 13(3), 245–260 (2017)

    MathSciNet  Google Scholar 

  25. Mathew, S., Mordeson, J.N., Malik, D.S.: Fuzzy Graph Theory, vol. 363. Springer, Berlin (2018)

    Google Scholar 

  26. Mathew, S., Mordeson, J.N., Malik, D.S.: Fuzzy Graph Theory with Applications to Human Trafficking, vol. 365. Springer, Berlin (2018)

    Google Scholar 

  27. Mathew, S., Sunitha, M.S.: Types of arcs in a fuzzy graph. Inf. Sci. 179, 1760–1768 (2009)

    MathSciNet  Google Scholar 

  28. Mordeson, J.N., Nair, P.S.: Arc disjoint fuzzy graphs. In: Proceedings of the 18th International Conference of the North American Fuzzy Information Processing Society, June, New York. https://doi.org/10.1109/NAFIPS.1999.781654

  29. Mordeson, J.N., Nair, P.S.: Cycles and cocycles of fuzzy graphs. Inf. Sci. 90, 39–49 (1996)

    MathSciNet  Google Scholar 

  30. Mordeson, J.N., Peng, C.S.: Operations on fuzzy graphs. Inf. Sci. 79, 159–170 (1994)

    MathSciNet  Google Scholar 

  31. Nagoor Gani, A., Radha, K.: On regular fuzzy graphs. J. Phys. Sci. 12, 33–44 (2008)

    Google Scholar 

  32. Nagoor Gani, A., Radha, K.: Conjunction of two fuzzy graphs. Int. Rev. Fuzzy Math. 3, 61–71 (2008)

    Google Scholar 

  33. Nagoor Gani, A., Radha, K.: The degree of a vertex in some fuzzy graphs. Int. J. Algorithms Comput. Math. 2, 107–116 (2009)

    Google Scholar 

  34. Rosenfeld, A.: Fuzzy graphs. In: Zadeh, L.A., Fu, K.S., Shimura, M. (eds.) Fuzzy Sets and Their Applications, pp. 77–905. Academic Press, New York (1975)

    Google Scholar 

  35. Samanta, S., Pal, M.: Fuzzy tolerance graphs. Int. J. Latest Trends Math. 1(2), 57–67 (2011)

    Google Scholar 

  36. Samanta, S., Pal, M.: Fuzzy threshold graphs. CIIT Int. J. Fuzzy Syst. 3(12), 360–364 (2011)

    Google Scholar 

  37. Samanta, S., Pal, M.: Bipolar fuzzy hypergraphs. Int. J. Fuzzy Logic Syst. 2(1), 17–28 (2012)

    Google Scholar 

  38. Samanta, S., Pal, M., Mahapatra, R., Das, K., Bhadoria, R.S.: A study on semi-directed graphs for social media networks. Int. J. Comput. Intell. Syst. 14(1), 1034–1041 (2021)

    Google Scholar 

  39. Samanta, S., Pal, M.: Irregular bipolar fuzzy graphs. Int. J. Appl. Fuzzy Sets 2, 91–102 (2012)

    Google Scholar 

  40. Sarwar, M., Akram, M., Shahzadi, S.: Bipolar fuzzy soft information applied to hypergraphs. Soft. Comput. 25(2), 1–23 (2021)

    Google Scholar 

  41. Sitara, M., Akram, M., Riaz, M.: Decision-making analysis based on q-rung picture fuzzy graph structures. J. Appl. Math. Comput. 67, 541–577 (2021)

    MathSciNet  Google Scholar 

  42. Sunitha, M.S., Vijayakumar, A.: A characterization of fuzzy trees. Inf. Sci. 113, 293–300 (1999)

    MathSciNet  Google Scholar 

  43. Sunitha, M.S., Vijayakumar, A.: Complement of a fuzzy graph. Indian J. Pure Appl. Math. 33, 1451–1464 (2002)

    MathSciNet  Google Scholar 

  44. Sunitha, M.S., Vijayakumar, A.: Some metric aspects of fuzzy graphs. In: Balakrishna, R., Mulder, H.M., Vijayakumar, A. (Eds.), Proceedings of the Conference on Graph Connections, CUSAT, pp. 111–114. Allied Publishers, Cochin (1999)

  45. Yeh, R.T., Bang, S.Y.: Fuzzy relations, fuzzy graphs and their applications to cluster analysis. In: Zadeh, L.A., Fu, K.S., Shimura, M. (eds.) Fuzzy Sets and Their Applications, pp. 125–149. Academic Press, New York (1975)

    Google Scholar 

  46. Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National Institute of Technology Calicut, Calicut, 673601, India

    G. Gayathri & Sunil Mathew

  2. Department of Mathematics, Creighton University, Omaha, 68178, USA

    J. N. Mordeson

Authors
  1. G. Gayathri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sunil Mathew
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. N. Mordeson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Gayathri.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gayathri, G., Mathew, S. & Mordeson, J.N. Max-flow min-cut theorem for directed fuzzy incidence networks. J. Appl. Math. Comput. 70, 149–173 (2024). https://doi.org/10.1007/s12190-023-01952-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-023-01952-x

Keywords

Mathematics Subject Classification

Search

Navigation