Abstract Paper


Journal of Computational Mathametica

Title : Some New Results on Total Equitable Domination in Graphs
Author(s) : 1 S. K. Vaidya, and 2 A. D. Parmar
Article Information : , 98-103
Affiliation(s) : 1 Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India - 360005
: 2 Atmiya Institute of Technology and Science for Diploma Studies, Rajkot, India- 360005

Abstract :

<p>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)| less than or equal to 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. In this paper we contribute some general results on this concept.<br></p>


Keywords : Dominating set, equitable dominating set, total dominating set
Document Type : Research Paper
Publication date : May 20, 2017