{
  "id": "1909.07235",
  "version": "v1",
  "published": "2019-09-16T14:26:29.000Z",
  "updated": "2019-09-16T14:26:29.000Z",
  "title": "Skew throttling",
  "authors": [
    "Emelie Curl",
    "Jesse Geneson",
    "Leslie Hogben"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-09-16T14:26:29.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C57",
      "05C15",
      "05C50"
    ],
    "keywords": [
      "color change rule",
      "initial blue vertices",
      "exact skew throttling numbers",
      "sharp lower bound",
      "vertices blue"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}