CFP last date
20 December 2024
Reseach Article

Strong (Weak) Domination Intuitionistic Fuzzy Graphs

by J. John Stephan, A. Muthaiyan, N. Vinoth Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 107 - Number 16
Year of Publication: 2014
Authors: J. John Stephan, A. Muthaiyan, N. Vinoth Kumar
10.5120/18835-0356

J. John Stephan, A. Muthaiyan, N. Vinoth Kumar . Strong (Weak) Domination Intuitionistic Fuzzy Graphs. International Journal of Computer Applications. 107, 16 ( December 2014), 16-18. DOI=10.5120/18835-0356

@article{ 10.5120/18835-0356,
author = { J. John Stephan, A. Muthaiyan, N. Vinoth Kumar },
title = { Strong (Weak) Domination Intuitionistic Fuzzy Graphs },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 107 },
number = { 16 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 16-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume107/number16/18835-0356/ },
doi = { 10.5120/18835-0356 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:41:13.444254+05:30
%A J. John Stephan
%A A. Muthaiyan
%A N. Vinoth Kumar
%T Strong (Weak) Domination Intuitionistic Fuzzy Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 107
%N 16
%P 16-18
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Let G be an IFG. Then is said to be a strong (weak) dominating set if every is strongly (weakly) dominated by some vertex in D. We denote the strong (weak) intunionistic fuzzy dominating set by sid-set (wid-set). The minimum vertex cardinality over all the sid-set (wid-set) is called the strong (weak) dominating number of an IFG and is denoted by . In this paper, introduce the strong (weak) domination in intunionistic fuzzy graphs and obtain some bounds in IFG.

References
  1. Arumugam. S and Velammal. S, Edge Domination in Graphs, Taiwanese Journal Of Mathematics, Vol. 2, No. 2, pp. 173-179, June 1998
  2. Ayyaswamy. S, and Natarajan. C, International Journal of Computational and Mathematical sciences, 2010.
  3. K. Atanassov, Intuitionistic Fuzzy Sets: Theory and Applications, Physica-Verlag, New York (1999).
  4. Harary. F. , Graph Theory, Addition Wesely, Third Printing, October 1972.
  5. Mordeson,J. N. , and Nair, P. S. , Fuzzy graphs andFuzzy Hyper graphs, Physica-Verlag, Heidelberg,1998,second edition,2001.
  6. Nagoor Gani, A. , and Vadivel. P, Relation between the Parameter of Independent Domination and Irredundance in Fuzzy Graph, International Journal of Algorithms, Computing and Mathematics, Vol 2,2009. of Algorithms, Computing and Mathematics,Vol 2,2009.
  7. Nagoor Gani A, Shajithab Begum S, Degree, Order and Size in Intuitionistic Fuzzy Graphs, International journal of algorithms, Computing and Mathematics, Volume 3, Number 3, August 2010
  8. Somasundaram,A. ,Somasundaram,S. ,1998,domination in Fuzzy Graphs-I, Pattern Recognition Letters, 19, pp. 787–791.
  9. Somasundaram, A. , 2004, Domination in Fuzzy Graph-II, Journal of Fuzzy Mathematics, 20
  10. R. B. Allan and R. Laskar, On domination and independant domination of a graph, Discrete Math. 234 (1978), 73 – 76
  11. Somasundaram, A. , Somasundaram, S. , 1998, Domination in Fuzzy Graphs-I, Pattern
  12. Nagoor Gani, A, and Basher Ahamed. M, Order and Size in Fuzzy Graphs, Bulletin of Pure and Applied Science, Vol 22E, 2003; p. 145-148
  13. C. Natarajan and S. K. Ayyaswamy, on strong weak domination in fuzzy graphs, World Academy of Science, Engineering and Technology, Vol:4 2010-07-24
Index Terms

Computer Science
Information Sciences

Keywords

Intuitionistic fuzzy graph strong (weak) domination strong (weak) domination number