The maximum number of maximum dissociation sets in trees
The maximum number of maximum dissociation sets in trees
Abstract A subset of vertices is a maximum independent set if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1, and the subset has maximum …