The maximum number of maximum dissociation sets in potted graphs

Zejun Huang, Xinwei Zhang

A potted graph is a unicyclic graph such that its cycle contains a unique vertex with degree larger than 2. Given a graph $G$, a subset of $V(G)$ is a dissociation set of $G$ if it…