collaborators

1 paper

math.CO2016

Total dominating sequences in trees, split graphs, and under modular decomposition

Boštjan Brešar, Tim Kos, Graciela Nasini +1

A sequence of vertices in a graph with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…