Open Access Open Access  Restricted Access Subscription or Fee Access

Strong (ARC) Edge Domination in Fuzzy Graphs

Dr.G. Geetha Ramani, N. Vinoth Kumar

Abstract


Let G:(,μ) be a fuzzy graph with SV is a dominating set of G and the dominating number (G).In this paper we define the strong edge dominating set D’ VV in G, we introduce a edge dominating number ’(G) is a minimum cardinality of edge dominating set of G. we prove some results in strong edge domination.

Keywords


Fuzzy Graphs, Fuzzy Strong (ARC) Edge Domination, Strong (Weak) Edge Domination, Fuzzy Strong (ARC) edge domination number. Strong (weak) fuzzy Edge Domination Number.

Full Text:

PDF

References


Arumugam.S and Velammal.S, Edge Domination in Graphs, Taiwanese Journal Of Mathematics, Vol.2, No.2, pp.173-179, June 1998

Ayyaswamy.S, and Natarajan.C, International Journal of Computational and Mathematical sciences, 2010.

Harary.F., Graph Theory, Addition Wesely, Third Printing, October 1972. [7] Somasundaram, A., Somasundaram, S., 1998, Domination in Fuzzy Graphs-I, Pattern

Mordeson,J.N., and Nair, P.S., Fuzzy graphs and Fuzzy Hyper graphs, Physica-Verlag, Heidelberg, 1998,second edition,2001.

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

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.

Somasundaram, A., Somasundaram,S.,1998, Domination in Fuzzy Graphs-I, Pattern Recognition Letters, 19, pp. 787–791.

Somasundaram, A., 2004, Domination in Fuzzy Graph-II, Journal of Fuzzy Mathematics, 20


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.