1 paper
Jean-Pierre Appel, Gabby Fischberg, Kyle Kelley +2
Let G=(V,E) be a connected, finite undirected graph. A set S⊆V is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in S. T…