Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

On The Connected Domatic Number of A Graph


Affiliations
1 Central Prison Palayamkottal - 627 002, India
2 Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli - 627 009, India
     

   Subscribe/Renew Journal


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.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 140

PDF Views: 0




  • On The Connected Domatic Number of A Graph

Abstract Views: 140  |  PDF Views: 0

Authors

J. Paulraj Joseph
Central Prison Palayamkottal - 627 002, India
S. Arumugam
Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli - 627 009, India

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.