Graph Sensitivity under Join and Decomposition

Cathy Kriloff, Jacob Tolman

The sensitivity, $\sigma (G)$, of a finite undirected simple graph $G$ is the smallest maximum degree of an induced subgraph on more than the maximum number of independent vertices. Call…