The week's pick
Reseach Article
A Study on Double, Triple and N - Tuple Domination of Fuzzy Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 107 - Number 9 |
| Year of Publication: 2014 |
| Authors: S. Senthilraj |
10.5120/18776-0091
|
S. Senthilraj . A Study on Double, Triple and N - Tuple Domination of Fuzzy Graphs. International Journal of Computer Applications. 107, 9 ( December 2014), 1-7. DOI=10.5120/18776-0091
Abstract
In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V-Sis adjacent to at least one vertex in S. The minimum cardinality taken over all, the minimal double dominating set which is calledFuzzy Double DominationNumber and which is denoted as . A set is called a Triple dominating set of a graph G if every vertex in V dominated by at least three vertices in S. The minimum number of colours required to colour all the vertices such that adjacent vertices do not receive the same colour is the chromatic number . The minimum cardinality of a triple dominating set is called Triple domination number of G and is denoted by . The connectivity of a connected graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph. For any graph,G a complete sub graph of G is called a clique of G. For a fixed positive integer k, the n-tuple domination problem is to find a minimum vertex subset such that every vertex in the graph dominated by at least k vertices in this set. In this paper we find an upper bound for the sum of the Fuzzy Double Domination, Triple domination, Chromatic Number in fuzzy graphs and characterize the corresponding extremal fuzzy graphs.
References
- Harary. F, and T. W. Haynes, Nordhaus-Gaddum inequalities for domination in graphs, Discrete Math. 155(1996), 99-105.
- Harary. F. and T. W. Haynes, Double Domination in graphs,Arscombin. 55, (2000), Pp. 201 - 213.
- Haynes. T. W, S. T. Hedetniemi and P. J. Slater, Domination in Graphs Selected Topics, Marcel Dekker, New York, (1998).
- Kaufmann, A. Introduction to the Theory of Fuzzy Subsets, Academic Press, New York, (1975).
- Mahadevan. G, Selvam A, MydeenBibi A, Double Domination Number and Chromatic Number of a Graph, Narosa Publication, (2008), 382 - 390.
- Mahadevan. G, V. K. Shanthi&A. MydeenBibi, Fuzzy Double Domination Number and Chromatic Number of a Fuzzy Graph, International Journal of Information Technology and Knowledge Management, Vol. 4, (2011), 495 – 499.
- NellaiMurugan. A, Triple Domination Number and its Connectivity to complete Graphs, Int. Journal of Engineering Research and Applications, Vol. 4, (2014), 188 – 192.
- Paulraj Joseph. J and S. Arumugam, Domination and connectivity in Graphs, International Journal of management and systems, 8, (1992), 233 - 236.
- Rosenfeld, A. , Fuzzy Graphs In: Zadeh, L. A. , Fu, K. S. , Shimura, M. , Fuzzy Sets and their Applications, Academic Press, New York.
- Senthilraj. S, Edge Critical Graphs with Double Domination, National Conference on Computing Technology Proceedings, VCMCS, Chennai, (2008), 51- 64.
- Senthilraj. S, On the Matrix of Chromatic Joins Journal of Applied and Information Technology, Vol. 4, (3), (2008), 106 - 110.
- Senthilraj. S, Planar Graphs with Small Diameter Dominations, Proceedings of International Conference on Discrete Mathematics, University of Mysore, Mysore,(2008), 204.
- Senthilraj. S, Boundary of Strong Minimum Dominate Graphs, International Journal of Computer Mathematical Sciences and Applications, Serials Pub, Vol. 3, No. 1-2, (2009), 157- 161
- Senthilraj. S, Domination Related Parameters on Bounds, International Journal on Computer Engineering and Information Technology, Vol. 4 No. 6, (2009), 34 -42.
- Senthilraj. S, Fuzzy Graph Applications of Job Allocation, International Journal of Engineering and Innovative Technology, Vol. 1 No. 2, (2012), 7 - 10.
- Senthilraj. S, Scheduling Application Using Fuzzy Chromatic Sum,The Abstract Proceedings of International Conference on Knowledge Management and Resource Sharing, (2012), 204.
- Senthilraj. S, The N Tuple Domination of Graphs with Algorithmic Approach, Proceedings of International Conference on Mathematicsand Computer Science, Vol. 1, (2009), 69 - 71.
- Sivagnanam. C, Double Domination Number and Connectivity of Graphs, International Journal of Digital Information and Wireless Communications, The Society of Digital Information and Wireless Communications, (2012), 40 - 45.
- Somasundaram, A, Somasundaram, S, Domination in Fuzzy Graphs – I, Pattern Recognition Letters, 19, (1998), 787 - 791.
- Zadeh, L. A. Similarity Relations and Fuzzy Ordering, Information Sciences, 3(2), (1971), 177 – 200.
Index Terms
Keywords