Name
Title | ||
|---|---|---|
Sharp Upper Bounds On The K-Independence Number In Graphs With Given Minimum And Maximum Degree |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00373-020-02244-y | GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
k-independence number, Independence number, Chromatic number, k-distance chromatic number, Regular graphs | Journal | 37 |
Issue | ISSN | Citations |
2 | 0911-0119 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suil O | 1 | 0 | 0.34 |
| Yongtang Shi | 2 | 511 | 55.83 |
| Zhenyu Taoqiu | 3 | 0 | 0.68 |