Complementary nil vertex edge dominating sets
-
Siva Rama Raju, S. V. [1] ; Nagaraja Rao, I. H. [2]
-
[1] Ibra College of Technology.
-
[2] G. V. P. P. G. Courses Visakhapatnam.
-
- Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 34, Nº. 1, 2015, págs. 1-14
- Idioma: inglés
- DOI: 10.4067/S0716-09172015000100001
- Enlaces
-
Resumen
Dominating sets play a vital role in day-to-day life problems. For-providing effective services in a location, central points are to be identified. This can easily be achieved by graph theoretic techniques. Such graphs and relevant parameters are introduced and extensively studied. One such parameter is complementary nil vertex edge dominating set(cnved-set). A vertex edge dominating set(ved-set) of a connected graph G with vertex set V is said to be a complementary nil vertex edge dominating set(cnved-Set) of G if and only if V — D is not a ved-set of G. A cnved-set of minimum cardinality is called a minimum cnved-set(mcnved-set)of G and this minimum cardinality is called the complementary nil vertex-edge domination number of G and is denoted by γcnve(G). We have given a characterization result for a ved-set to be a cnved-set and also bounds for this parameter are obtained.
-
Referencias bibliográficas
- Citas [1] Bondy J. A. and Murthy, U. S. R., Graph theory with Applications, The Macmillan Press Ltd, (1976).
- [2] Danut Marcu, A Note On the Domination Number Of a Graph and its Complement. MATHEMATICA BOHEMICA, Vol. 126 (1), pp. 63-65, (2001).
- [3] T. W.Haynes, S. T. Hedetneimi, P.J. Slater, Fundamentals of Dominations in Graphs, Marcel Dekker, New York, (1988).
- [4] J. D.Horton, K. Kilakos, Minimum edge dominating sets. SIAM J.Discrete Math., Vol. 6 (3), pp. 375-387, (1993).
- [5] R. Laskar, K. Peters, Vertex and edge dominating parameters in Graphs. Congr.Numer., Vol. 48, pp. 291-305, (1985).
- [6] T. Tamizh Chelvam, S. Robinson Chellathurai, Complementary Nil Domination Number of a Graph. Tamkang Journal Of Mathematics., Vol. 40...
