The Maximal 2-independent Sets in Trees
- https://doi.org/10.2991/amsm-16.2016.25How to use a DOI?
- independent set; maximal independent set; 2-independent set; maximal 2-independent set; tree
A 2-independent set in a graph G is a subset I of the vertices such that the distance between any two vertices of I in G is at least three. We say that I is a maximal 2-independent set in G if it is not a proper subset of any other 2-independent set. In this paper, we study the problem of determining the small numbers of maximal 2-independent sets among all trees of order n. Extremal graphs achieving these values are also given.
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Min-Jen Jou AU - Jenq-Jong Lin PY - 2016/05 DA - 2016/05 TI - The Maximal 2-independent Sets in Trees BT - Proceedings of the 2016 International Conference on Applied Mathematics, Simulation and Modelling PB - Atlantis Press SP - 106 EP - 109 SN - 2352-538X UR - https://doi.org/10.2991/amsm-16.2016.25 DO - https://doi.org/10.2991/amsm-16.2016.25 ID - Jou2016/05 ER -