Abstract
A set of vertices D is a dominating set of a graph G=(V, E) if every vertex in V−D is adjacent to at least one vertex in D. The domatic partition of G is the partition of the vertex set V into a maximum number of dominating sets. In this paper, we present efficient parallel algorithms for finding the domatic partition of Interval graphs, Block graphs and K-trees.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
