Upper bound for the number of maximal dissociation sets in trees

Ziyuan Wang, Lei Zhang, Jianhua Tu +1

Let $G$ be a simple graph. A dissociation set of $G$ is defined as a set of vertices that induces a subgraph in which every vertex has a degree of at most 1. A dissociation set is…