1998
DOI: 10.1016/s0167-8655(98)00064-6
|View full text |Cite
|
Sign up to set email alerts
|

Domination in fuzzy graphs – I

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
125
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 196 publications
(125 citation statements)
references
References 9 publications
0
125
0
Order By: Relevance
“…2 (x, y) = 1 (x) 1 (y) and 2 (x, y) = 1 (x) 1 (y) for all x, y V. (1) and (3) we get 2 (x, y) = 2 (x, y) (4) If 1 normal, 1 (t) =1 for some t. Then (2) and (5) we get 2 (x, y) = 2 (x, y) (6) Now assuming that 2 k (x, y) = 2 (x, y) and 2 k (x, y) = 2 (x, y) we will prove 2 k+1 (x, y) = 2 (x, y) and 2 k+1 (x, y) = 2 (x, y) we have (u) 11 (v) (iv) from (iii) and (iv) we get (i) ( 12 + 22 )(u,v)= 12 (u,v) (v) and ( 11 + 21 )(u) ( 11 + 21 )(v)= 11 (u) 11 (v) (vi) from (v) and (vi) we get (ii) Therefore we get G 1 + G 2 is a product intuitionistic fuzzy sub graph of G. Similarly we can prove (u, v) X 1 . (u) 11 (v) and 12 (u, v) = 11 (u) 11 (v).…”
Section: Definition 23 a Product Intuitionistic Fuzzy Graph G = (Vementioning
confidence: 92%
“…2 (x, y) = 1 (x) 1 (y) and 2 (x, y) = 1 (x) 1 (y) for all x, y V. (1) and (3) we get 2 (x, y) = 2 (x, y) (4) If 1 normal, 1 (t) =1 for some t. Then (2) and (5) we get 2 (x, y) = 2 (x, y) (6) Now assuming that 2 k (x, y) = 2 (x, y) and 2 k (x, y) = 2 (x, y) we will prove 2 k+1 (x, y) = 2 (x, y) and 2 k+1 (x, y) = 2 (x, y) we have (u) 11 (v) (iv) from (iii) and (iv) we get (i) ( 12 + 22 )(u,v)= 12 (u,v) (v) and ( 11 + 21 )(u) ( 11 + 21 )(v)= 11 (u) 11 (v) (vi) from (v) and (vi) we get (ii) Therefore we get G 1 + G 2 is a product intuitionistic fuzzy sub graph of G. Similarly we can prove (u, v) X 1 . (u) 11 (v) and 12 (u, v) = 11 (u) 11 (v).…”
Section: Definition 23 a Product Intuitionistic Fuzzy Graph G = (Vementioning
confidence: 92%
“…Several fuzzy analogs of graph theoretic concepts such as paths, cycle's connectedness etc., the concept of domination in fuzzy graphs was investigate and presents the concepts of independent domination, total domination, connected domination and domination in Cartesian product and composition of fuzzy graphs [19]. Several authors have studied the problem of obtaining an upper bound for the sum of a domination parameter and a graph theoretic parameter and characterized the corresponding extremal graphs.…”
Section: Fuzzy Graphmentioning
confidence: 99%
“…Nagoor Gani, A and Sajitha Begum, S [3] defined degree, Order and Size in intuitionistic fuzzy graphs and extend the properties. The concept of Domination in fuzzy graphs is introduced by A. Somasundaram and S. Somasundaram [10] in the year 1998. Parvathi and Thamizhendhi [5] introduced the concepts of domination number in Intuitionistic fuzzy graphs.…”
Section: Imentioning
confidence: 99%