Learn More
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions , such that each partition induces a connected subgraph, and the partitions differ in size by at most one. We examine the problem from the parameterized complexity perspective with respect to the number of partitions, the(More)
For any graph G = (V, E), D  V is a global dominating set if D dominates both G and its complement G. The global domination number  g (G) of a graph G is the fewest number of vertices required of a global dominating set. In general, max{(G), (G)} ≤  g (G) ≤ (G)+(G), where (G) and (G) are the respective domination numbers of G and G. We show, when G(More)
  • 1