New Results on $k$-Independence of Graphs

[摘要] Let $G = (V, E)$ be a graph and $k \geq 0$ an integer. A $k$-independent set $S \subseteq G$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. Denote by $\alpha_{k}(G)$ the maximum cardinality of a $k$-independe

[学科分类] 离散数学和组合数学

[关键词] Graph theory;$k$-Independent set