Trees with a unique maximum independent set and their linear properties

Abstract

Trees with a unique maximum independent set encode the maximum matching structure in every tree. In this work we study some of their linear properties and give two graph operations, stellare and S-coalescence, which allow building all trees with a unique maximum independent set. The null space structure of any tree can be understood in terms of these graph operations.