EXCELLENT-JUST EXCELLENT-DEGREE EQUITABLE DOMINATION IN GRAPHS

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published Oct 3, 2013
K.M. Dharmalingam*, V. Swaminathan

Abstract

Let G = (V, E) be a simple graph. A subset D of V(G) is said to be a degree equitable dominating set of G if for every there exists a vertex such that u and v are adjacent &1)vdeg()udeg(≤−. The minimum cardinality of a degree equitable dominating set of G is denoted by )G(eγ. A degree equitable dominating set of G of minimum cardinality is called as a eγ-set of G. G is said to be eγ-excellent if every vertex of G belongs to a eγ-set of G. This paper aims at the study of the new concept namely degree equitable excellent graphs. Just eγ-excellence is also defined and studied. Results on these new concepts are compared with those with respect to domination excellence and justγ-excellence in graphs. 2010 Mathematics Subject Classification : 05C69

How to Cite

EXCELLENT-JUST EXCELLENT-DEGREE EQUITABLE DOMINATION IN GRAPHS. (2013). Asian Journal of Current Engineering and Maths, 1(2). http://informaciontechnologica.com/index.php/ajcem/article/view/35
Abstract 130 | PDF Downloads 122

##plugins.themes.bootstrap3.article.details##

Section
Articles

How to Cite

EXCELLENT-JUST EXCELLENT-DEGREE EQUITABLE DOMINATION IN GRAPHS. (2013). Asian Journal of Current Engineering and Maths, 1(2). http://informaciontechnologica.com/index.php/ajcem/article/view/35