Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs

Jianhua Tu, Yuxin Li, Junfeng Du

A subset of vertices $F$ in a graph $G$ is called a \emph{dissociation set} if the induced subgraph $G[F]$ of $G$ has maximum degree at most 1. A \emph{maximal dissociation set} of…