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.
机构:
State Univ New York, Dept Appl Math & Stat, Incheon 21985, South KoreaState Univ New York, Dept Appl Math & Stat, Incheon 21985, South Korea
Suil, O.
Shi, Yongtang
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaState Univ New York, Dept Appl Math & Stat, Incheon 21985, South Korea
Shi, Yongtang
Taoqiu, Zhenyu
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaState Univ New York, Dept Appl Math & Stat, Incheon 21985, South Korea
机构:
State Univ New York, Dept Appl Math & Stat, Incheon 21985, South KoreaState Univ New York, Dept Appl Math & Stat, Incheon 21985, South Korea
Suil, O.
Shi, Yongtang
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaState Univ New York, Dept Appl Math & Stat, Incheon 21985, South Korea