Vol. 1 No. 1 (2017): Vol 1, Iss 1, Year 2017
Some New Results on Total Equitable Domination in Graphs
Published June 30, 2017
- Dominating set, Equitable Dominating set, Total Dominating set
How to Cite
S K, V., & A D, P. (2017). Some New Results on Total Equitable Domination in Graphs. Journal of Computational Mathematica, 1(1), 99-103. https://doi.org/10.26524/cm7
A dominating set D is total if every vertex of V is adjacent to at least one vertex of D while D is called equitable if for every u in D there exists a vertex v in V D such that |d(u)d(v)| ≤ 1.A dominating set which is both total and equitable is called total equitable dominating set.The total equitable domination number of G is the minimum cardinality of a total equitable dominating set of G which is denoted by γ_t^e (G). In this paper we contribute some general results on this concept.
Download data is not yet available.