Advertisement

# Fuzzy Graphs

• John N. Mordeson
• Premchand S. Nair
Chapter
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 46)

## Abstract

A graph is a pair (V, R), where V is a set and R is a relation on V. The elements of V are thought of as vertices of the graph and the elements of R are thought of as the edges Similarly, any fuzzy relation ρ on a fuzzy subset μ of a set V can be regarded as defining a weighted graph, or fuzzy graph, where the edge (x, y) ∈ V × V has weight or strength ρ(x, y) ∈ [0, 1]. In this chapter, we shall use graph terminology and introduce fuzzy analogs of several basic graph-theoretical concepts. For simplicity, we will consider only undirected graphs through out this chapter unless otherwise specified. Therefore, all fuzzy relations are symmetric and all edges are regarded as unordered pairs of vertices. We abuse notation by writing (x, y) for an edge in an undirected graph (V, R), where x, yV. (We need not consider loops, that is, edges of the form (x, x); we can assume, if we wish, that our fuzzy relation is reflexive.) Formally, a fuzzy graph G = (V, μ, ρ) is a nonempty set V together with a pair of functions μ: V → [0, 1] and μ: V × V → [0, 1] such that for all x, y in V, ρ(x, y) ≤ μ(x) ∧ μ(y). We call μ the fuzzy vertex set of G and ρ the fuzzy edge set of G, respectively. Note that ρ is a fuzzy relation on μ. We will assume that, unless otherwise specified, the underlying set is V and that it is finite. Therefore, for the sake of notational convenience, we omit V in the sequel and use the notation G = (μ,ρ). Thus in the most general case, both vertices and edges have membership value. However, in the special case where μ(x) = 1, for all xV, edges alone have fuzzy membership. So, in this case, we use the abbreviated notation G = (V, ρ). The fuzzy graph H = (v,τ) is called a partial fuzzy subgraph of G = (μ, ρ) if vμ and τρ. Similarly, the fuzzy graph H = (P, v, τ) is called a fuzzy subgraph of G = (V, μ, ρ) induced by P if PV, v(x) = μ(x) for all xP and τ(x, y) = ρ(x, y) for all x, yP. For the sake of simplicity, we sometimes call H a fuzzy subgraph of G. It is worth noticing that a fuzzy subgraph (P, v, τ) of a fuzzy graph (V, μ, ρ) is in fact a special case of a partial fuzzy subgraph obtained as follows.

## Keywords

Incidence Matrix Intersection Graph Fuzzy Subset Interval Graph Fuzzy Relation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

1. 1.
Arya, S.P. and Hazarika, D., Functions with closed fuzzy graph, J. Fuzzy Math. 2: 593–600, 1994.
2. 2.
Berge, C., Theorie des Graphes et ses Applications, Dunod, Paris, 1958.Google Scholar
3. 3.
Bhattacharya, P., Some remarks on fuzzy graphs, Pattern Recognition Letters 6: 297–302, 1987.
4. 4.
Bhattacharya, P. and Suraweera, An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs, Pattern Recognition Letters 12: 413–420, 1991.
5. 5.
Bhutani, K.R., On automorphisms of fuzzy graphs, Pattern Recognition Letters 9: 159–162, 1989.
6. 6.
Cerruti, U., Graphs and fuzzy graphs, Fuzzy Information and Decision Processes 123–131, North-Holland, Amsterdam-New York, 1982.Google Scholar
7. 7.
Chen, Q. J., Matrix representations of fuzzy graphs (Chinese), Math. Practice Theory 1: 41–46, 1990.Google Scholar
8. 8.
Crain, W.L., Characterization of fuzzy interval graphs, Fuzzy Sets and Systems 68: 181–193, 1994.
9. 9.
De Luca, A., and Termini, S., A definition of a non-probabilistic entropy in the setting of fuzzy sets theory, Inform. and Control 20: 301–312, 1972.
10. 10.
Delgado, M. and Verdegay, J.L., and Vila, M.A., On fuzzy tree definition, European J. Operational Res. 22: 243–249, 1985.
11. 11.
Dodson, C.T.J., A new generalization of graph theory, Fuzzy Sets and Systems 6: 293–308, 1981.
12. 12.
Dubois, D. and H. Prade, H., Fuzzy Sets and Systems, Theory and Applications, Academic Press, New York,1980.Google Scholar
13. 13.
Fishburn, P.C., Interval Orders and Interval Graphs, Wiley, New York, 1985.
14. 14.
Fulkerson, D.R. and O.A. Gross, O.A., Incidence matrices and interval graphs, Pacific J. Math. 5: 835–855, 1965.
15. 15.
Gilmore, P.C. and Hoffman, A.J., A characterization of comparability graphs and of interval Graphs, Canad. J. Math. 16: 539–548, 1964.
16. 16.
El-Ghoul, M., Folding of fuzzy graphs and fuzzy spheres, Fuzzy Sets and Systems 58: 355–363, 1993.
17. 17.
El-Ghoul, M., Folding of fuzzy torus and fuzzy graphs, Fuzzy Sets and Systems 80: 389–396, 1996.
18. 18.
Halpern, J., Set adjacency measures in fuzzy graphs, J. Cybernet. 5: 77–87, 1976.
19. 19.
Harary, F., On the group of the composition of two graphs, Duke Math. J. 26: 29–34, 1959.
20. 20.
Harary, F., Graph Theory, Addison Wesley, Third printing, October 1972.Google Scholar
21. 21.
Jacobson, M.S., McMorris, F.R. and Scheinerman, E.R., General results on tolerance intersection graphs, J. Graph Theory 15: 573–577, 1991.
22. 22.
Kaufmann, A., Introduction a la Theorie des sons-ensembles flous, Vol. 1, Masson Paris, 41–189, 1973.Google Scholar
23. 23.
Leenders, J.H., Some remarks on an article by Raymond T. Yeh and S.Y. Bang dealing with fuzzy relations: Fuzzy relations, fuzzy graphs, and their applications to clustering analysis, Fuzzy sets and their applications to cognitive and decision processes (Proc. U.S.-Japan Sem., Univ. Calif., Berkeley, Calif., 1974), 125–149, Simon Stevin 51:93–100, 1977/78.Google Scholar
24. 24.
Luo, C.S., Decomposition theorems and representation theorems in fuzzy graph theory (Chinese), J. Xinjiang Univ. Nat. Sci. 3: 27–33, 1986.
25. 25.
Luo, C.S., The theorems of decomposition and representation for fuzzy graphs, Fuzzy Sets and Systems 42: 237–243, 1991.
26. 26.
McAllister, L.M.N., Fuzzy intersection graphs, Intl. J. Computers in Mathematics with Applications 5: 871–886, 1988.
27. 27.
Marczewski, E., Sur deux Propriétés des Classes d’ensembles, Fund. Math. 33: 303–307, 1945.
28. 28.
McKee,T.A., Foundations of intersection graph theory, Utilitas Math. 40: 77–86, 1991.
29. 29.
Mordeson, J. N., Fuzzy line graphs, Pattern Recognition Letters 14: 381–384, 1993.
30. 30.
Mordeson, J.N. and Nair, P.S, Cycles and cocycles of fuzzy graphs, Inform. Sci. 90: 39–49, 1996.
31. 31.
Mordeson, J.N. and Peng, C-S, Operations on fuzzy graphs, Inform. Sci. 79: 159–170, 1994.
32. 32.
Mori, M. and Kawahara, Y., Fuzzy graph rewritings, Theory of rewriting systems and its applications (Japanese) 918: 65–71, 1995.
33. 33.
Roberts, F., Discrete Mathematical Models Prentice Hall, Englewood Cliffs, NJ,1976.Google Scholar
34. 34.
Rosenfeld, A., Fuzzy graphs, In: L. A. Zadeh, K. S. Fu, M. Shimura, Eds., Fuzzy Sets and Their Applications, 77–95, Academic Press, 1975.Google Scholar
35. 35.
Roubens, M. and Vincke, P., Linear fuzzy graphs, Fuzzy Sets and Systems 10: 79–86, 1983.
36. 36.
Sabidussi, G., The composition of graphs, Duke Math. J. 26: 693–696, 1959.
37. 37.
Sabidussi, G., Graph multiplication, Math. Z. 72: 446–457, 1960.
38. 38.
Sabidussi, G., The lexicographic product of graphs, Duke Math. J. 28: 573–578, 1961.
39. 39.
Sarma, R. D. and Ajmal, N., Category N and functions with closed fuzzy graph, Fuzzy Sets and Systems 63: 219–226, 1994.
40. 40.
Shannon, A., Atanassov, K., Intuitionistic fuzzy graphs from t-,13- and tß-levels, Notes IFS 1: 32–35, 1995.
41. 41.
Sunitha, M.S. and Vijayakumar, A., A characterization of fuzzy trees, Inform. Sci. 113: 293–300, 1999.
42. 42.
Sunouchi, H. and Morioka, M., Some properties on the connectivity of a fuzzy graph (Japanese), Bull. Sci. Engrg. Res. lab. Waseda Univ. no. 132, 70–78, 1991.
43. 43.
Takeda, E., Connectvity in fuzzy graphs, Tech. Rep. Osaka Univ. 23: 343–352, 1973.
44. 44.
Tong, Z. and Zheng, D., An algorithm for finding the connectedness matrix of a fuzzy graph, Congr. Numer. 120: 189–192, 1996.
45. 45.
Wu, L. G. and Chen, T.P., Some problems concerning fuzzy graphs (Chinese), J. Huazhong Inst. Tech. no 2, Special issue on fuzzy math, iv, 58–60, 1980.Google Scholar
46. 46.
Yeh, R.T. and Bang, S.Y., Fuzzy relations, fuzzy graphs, and their applications to clustering analysis, In: L. A. Zadeh, K. S. Fu, M. Shimura, Eds., Fuzzy Sets and Their Applications, 125–149, Academic Press, 1975.Google Scholar
47. 47.
Zadeh, L.A., Similarity relations and fuzzy ordering, Inform. Sci. 3: 177–200, 1971.
48. 48.
Zimmermann, H.J., Fuzzy Set Theory and its Applications KluwerNijhoff, Boston,1985.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 2000

## Authors and Affiliations

• John N. Mordeson
• 1
• Premchand S. Nair
• 2
1. 1.Center for Research in Fuzzy Mathematics and Computer ScienceOmahaUSA
2. 2.Department of Mathematics and Computer ScienceCreighton UniversityOmahaUSA