On M-strong fuzzy graphs

Authors:
Kiran R. Bhutani;Abdella Battou
Affiliations:
Department of Mathematics, The Catholic University of America, Cardinal Station, Washington, DC;Lambda Optical Systems, 12100 Sunset Hills #100, Reston, VA
Venue:
Information Sciences: an International Journal
Year:
2003

Citing 4
Cited 3

Some remarks on fuzzy graphs

Pattern Recognition Letters
Fuzzy line graphs

Pattern Recognition Letters
Operations on fuzzy graphs

Information Sciences—Intelligent Systems: An International Journal
Strong arcs in fuzzy graphs

Information Sciences: an International Journal

Types of arcs in a fuzzy graph

Information Sciences: an International Journal
Interval-valued fuzzy graphs

Computers & Mathematics with Applications
Bipolar fuzzy graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

The cartesian product and disjoint sum of graphs play a prominent role and have numerous interesting algebraic properties. In this note, we consider operations on fuzzy graphs under which M-strong property is preserved. If G1 and G2 are M-strong fuzzy graphs then we prove that G1 × G2, G1 [G2] and G1 + G2 are also M-strong but G1 ∪ G2 need not be M-strong. If G1 × G2 is M-strong then we show that at least one factor must be M-strong. We show that the product of a M-strong fuzzy graph G1 with a non-M-strong fuzzy graph G2 remains M-strong if and only if G2 satisfies special condition. For any fuzzy graph G, Gcc is the smallest M-strong fuzzy graph that contains G and G = Gcc if and only if G is M-strong. We further show that M-strong fuzzy graph G is a fuzzy tree if and only if the support(G) is a tree.