Abstract Views :141 |
PDF Views:0
Authors
Affiliations
1 Central Prison Palayamkottal - 627 002, IN
2 Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli - 627 009, IN
Source
Journal of the Ramanujan Mathematical Society, Vol 9, No 1 (1994), Pagination: 69-77
Abstract
The connected domatic number dc of a graph G = (V, E) is the maximum order of a partition of V into connected dominating sets in G. In this paper we prove that for any graph G such that both G and G are connected, dc+d≤p-2 and characterize the class of graphs for which equality holds.
Keywords
Connected Domination, Connected Domatic Number, Perfect Domi Nation.