Computational Complexity of Vertex Integrity: Parameterized Hardness and Tractability Results

Vertex integrity is a graph parameter that measures the connectivity of a graph. This paper investigates the parameterized complexity of computing vertex integrity, presenting several new hardness and tractability results.