Open Access
Subscription Access
Open Access
Subscription Access
On The Connected Domatic Number of A Graph
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
Font Size
Information
Abstract Views: 213
PDF Views: 0