(-k)-critical trees and k-minimal trees

Walid Marweni

In a graph $G=(V,E)$, a module is a vertex subset $M$ of $V$ such that every vertex outside $M$ is adjacent to all or none of $M$. For example, $\varnothing$, $\{x\}$ $(x\in V)$ and…