ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Journal Article
Publisher : Taylor & Francis
Source : Journal of Discrete Mathematical Sciences and Cryptography, Taylor & Francis, Volume 2, Number 2-3, p.179–184 (1999)
Campus : Bengaluru
School : School of Engineering
Department : Mathematics
Year : 1999
Abstract : A dominating set D of a graph G = (V,E) is a cototal dominating (c.t.d.) set if every vertex v ∈ V−D is not an isolated vertex in the induced subgraph V − D. The cototal domination number γcl (G) of G is the minimum cardinality of a c.t.d. set. The cototal domatic number dCt (G) of G is defined like domatic number d(G). In this paper, we establish some results concerning these parameters.
Cite this Research Publication : V. R. Kulli, Janakiram, B., and Iyer, R. R., “The cototal domination number of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 2, pp. 179–184, 1999.