Sharp upper bounds on the $k$-independence number in graphs with given minimum and maximum degree
| Autor: | Taoqiu, Zhenyu, O, Suil, Shi, Yongtang |
|---|---|
| Rok vydání: | 2019 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | The $k$-independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$. In this paper, for each positive integer $k$, we prove sharp upper bounds for the $k$-independence number in an $n$-vertex connected graph with given minimum and maximum degree. Comment: 16 pages, 11 figures |
| Databáze: | arXiv |
| Externí odkaz: |
|