nach oben

Journal of Applied Mathematics and Computing

Erschienen in:

15.12.2023 | Original Research

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

verfasst von: G. Gayathri, Sunil Mathew, J. N. Mordeson

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1/2024

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications

Nächster Artikel Application of elastic transformation method and similarity construction method in solving ordinary differential equations

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

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

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

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

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

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

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

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

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)MathSciNetPubMed

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

10.

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

11.

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

12.

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

13.

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

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)PubMedPubMedCentral

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

17.

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

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

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)

21.

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

22.

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

23.

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

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

25.

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

26.

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

27.

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

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

30.

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

31.

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

32.

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

33.

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

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)

35.

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

36.

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

37.

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

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)

39.

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

40.

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

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

42.

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

43.

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

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)

46.

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

Titel: Max-flow min-cut theorem for directed fuzzy incidence networks
verfasst von: G. Gayathri
Sunil Mathew
J. N. Mordeson
Publikationsdatum: 15.12.2023
Verlag: Springer Berlin Heidelberg
Erschienen in: Journal of Applied Mathematics and Computing / Ausgabe 1/2024
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI: https://doi.org/10.1007/s12190-023-01952-x

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 1/2024

On the exponential augmented Zagreb index of graphs

Quasi-uniform stability for fractional-order fuzzy neural networks with uncertain proportional delay

On the p-numerical radii of operator matrices

Efficient numerical schemes based on the cubic B-spline collocation method for time-fractional partial integro-differential equations of Volterra type

On distance Laplacian spectral ordering of some graphs

Optimization of disaster management using split domination in picture fuzzy graphs

Premium Partner