Department of Mathematics and Computing Skills University of Technology and Applied Sciences , Sur, 411, Sultanate of Oman
S. Kaviya, G. Mahadevan, C. Sivagnanam
In this paper: A dominating set S in a graph G is termed a Triple Connected Certified Dominating Set (TCCD-set) if, for each vertex v in S, either the number of neighbors of v in V – S is zero or k where k ≥ 2, and...
G. Mahadevan, K. Priya, C. Sivagnanam
In this paper: The concept of the CTATD number has been recently further developed, expanding on the original work by Mahadevan, Priya, and Sivagnanam [4]. A subset S ⊆ V is considered a CTATD set for a graph G if f...
L. Praveenkumar, G. Mahadevan, C. Sivagnanam
In this paper: Corona domination number is defined as, if each vertex in the graph induced by a dominating set. 𝒟 satisfies the condition that either d(u) = 1 or there exist v ∈ 𝒟 such that u ∈ N(v), and d⟨𝒟⟩ (v) =...
Install TARU PUBLICATIONSFaster access from your home screen