Abstract
The competition-independence number of a graph is defined by the following game. Two players take turns in constructing a maximal independent set M, where one player tries to maximize |M| and one player tries to minimize |M|. Phillips and Slater determined the parameter for paths. In this note, we first revisit paths and determine the parameter that results when maximal independent set is generalized to maximal k-packing. Then we provide bounds for the original parameter on trees of maximum degree at most 3.
Original language | English |
---|---|
Pages (from-to) | 161-170 |
Number of pages | 10 |
Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
Volume | 104 |
Publication status | Published - Feb 2018 |
ASJC Scopus subject areas
- General Mathematics