2019/09/16 by Emelie Curl, Jesse Geneson, Curl, Emelie +3 · 1 citation
Computer Science · #Computability, Logic, AI Algorithms
paper · pdf · doi:10.48550/arxiv.1909.07235
Zero forcing is a process that colors the vertices of a graph blue by starting with some vertices blue and applying a color change rule. Throttling minimizes the sum of the number of initial blue vertices and the time to color the graph. In this paper, we study throttling for skew zero forcing. We characterize the graphs of order n with skew throttling numbers 1, 2, n-1, and n. We find the exact skew throttling numbers of paths, cycles, and balanced spiders with short legs. In addition, we find a sharp lower bound on skew throttling numbers in terms of the diameter.