Number of maximal 2-component independent sets in forests
Let $ G = (V(G), E(G)) $ be a graph. For a positive integer $ k $, we call $ S\subseteq V(G) $ a $ k $-component independent set of $ G $ if each component of $ G[S] $ has order at most $ k $. Moreover, $ S $ is maximal if there does not exist a $ k $-component independent set $ S' $ of $ G $ s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-05-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022748?viewType=HTML |