Total Outer Equitable Connected Domination of a Graph

Jayaprakash M. C; Deepak G

doi:https://doi.org/10.14445/22315373/IJMTT-V9P515

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 9 | Number 2 | Year 2014 | Article Id. IJMTT-V9P515 | DOI : https://doi.org/10.14445/22315373/IJMTT-V9P515

Total Outer Equitable Connected Domination of a Graph

Jayaprakash M. C , Deepak G

Abstract

Let G = (V, E) be a graph. A set D V (G) is equitable dominating set of G if v V – D a vertex u D such that uv E (G) and |d(u) – d(v)| 1. A set D V (G) is outer equitable dominating set if D is equitable dominating and is connected graph. The outer equitable connected domination number of G is the minimum cardinality of the outer-equitable connected dominating set of G and is denoted by oec(G). We introduce in this paper the concept of total outer equitable connected domination, exact values for some particular classes of graphs are found, some results on total outer equitable domination number are also established.

Keywords

Graph, total outer equitable connected dominating set, total outer equitable connected domination number.

References

1) K.D. Dharmalingam and V. Swaminathan, Degree equitable domination on graph, Kragujevac Journal of Mathematics, Vol-35, No. 1, (2011), pages 191-197.
2) F. Harary, Graph Theory, Addison-Wessley, Reading Mass. (1969).
3) T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of domination in graphs, Marcel Dekker Inc., New York (1998).

Citation :

Jayaprakash M. C , Deepak G, "Total Outer Equitable Connected Domination of a Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 9, no. 2, pp. 141-144, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V9P515