Author:
Savithri T.,Anitha M.,Balamurugan S.
Abstract
Let be a finite graph with vertices and edges. A subset of vertices in a graph is called a majority dominating set if at least half of the vertices of are either in or adjacent to vertices of . That is . Let be simple fuzzy graph. We introduce the concept of fuzzy majority dominating set for a fuzzy graph. A subset of a vertices in a fuzzy majority dominating set if , where is a order of . The minimum cardinality of fuzzy majority dominating set is called a fuzzy majority domination number and is denoted by . We determine the fuzzy majority domination number , for some graph . Also, we obtained the bounds for the fuzzy majority domination number.
Publisher
Universidad Tecnica de Manabi
Subject
Education,General Nursing
Reference9 articles.
1. P. Bhattacharya, Some remarks on fuzzy graphs, Pattern Recognition Letters 6: 297-302, 1987.
2. J.A. Bondy and U.S.R.Murthy, Graph theory with Application, North-Holland, (1982).
3. I. Broere, J.H. Hattingh, M.A. Henning, A.A. McRae, Majority domination in graphs, Discrete Math. 138(1995)125-135.
4. Tara S. Holm, On Majority domination in graphs, Discrete Mathematics 239(2001)1-12.
5. J. Joseline Manora and V. Swaminathan, Studies in graph theory: Majority domination in graphs, Ph.D thesis, Madurai Kamaraj University, Madurai .