![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
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
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 164
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0