On M-strong fuzzy graphs

被引:71
作者
Bhutani, KR
Battou, A
机构
[1] Catholic Univ Amer, Dept Math, Washington, DC 20064 USA
[2] Lambda Opt Syst, Reston, VA 20190 USA
关键词
D O I
10.1016/S0020-0255(03)00157-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 G(1) and G(2) are M-strong fuzzy graphs then we prove that G(1) x G(2), G(1)[G(2)] and G(1) + G(2) are also M-strong but G(1) boolean OR G(2) need not be M-strong. If G(1) x G(2) 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 G(1) with a non-M-strong fuzzy graph G(2) remains M-strong if and only if G(2) satisfies special condition. For any fuzzy graph G, G(Cc) is the smallest M-strong fuzzy graph that contains G and G = G(Cc) 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. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:103 / 109
页数:7
相关论文
共 7 条
[1]   SOME REMARKS ON FUZZY GRAPHS [J].
BHATTACHARYA, P .
PATTERN RECOGNITION LETTERS, 1987, 6 (05) :297-302
[2]  
Bhutani K. R., 1987, PATTERN RECOGN, V9, P159
[3]   Strong arcs in fuzzy-graphs [J].
Bhutani, KR ;
Rosenfeld, A .
INFORMATION SCIENCES, 2003, 152 :319-322
[4]   OPERATIONS ON FUZZY GRAPHS [J].
MORDERSON, JN .
INFORMATION SCIENCES, 1994, 79 (3-4) :159-170
[5]   FUZZY LINE GRAPHS [J].
MORDESON, JN .
PATTERN RECOGNITION LETTERS, 1993, 14 (05) :381-384
[6]  
Mordeson JN, 2000, Fuzzy graphs and fuzzy hypergraphs
[7]  
Rosenfeld A., 1975, Fuzzy Sets and Their Application to Cognitive andDecision Processes, P77, DOI 10.1016/B978-0-12-775260-0.50008-6