Sharp Upper Bounds on the k-Independence Number in Graphs with Given Minimum and Maximum Degree

被引：0
|
作者：
Suil O
Yongtang Shi
Zhenyu Taoqiu
机构：
[1] The State University of New York,Department of Applied Mathematics and Statistics
[2] Nankai University,Center for Combinatorics and LPMC
来源：
Graphs and Combinatorics | 2021年 / 37卷
关键词：
-independence number; Independence number; Chromatic number; -distance chromatic number; Regular graphs; 05C69;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：393 / 408
页数：15
相关论文
共 50 条
  • [41] On the independent domination number of graphs with given minimum degree
    Glebov, NI
    Kostochka, AV
    DISCRETE MATHEMATICS, 1998, 188 (1-3) : 261 - 266
  • [42] On the game domination number of graphs with given minimum degree
    Bujtas, Csilla
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (03):
  • [43] Optimal pebbling number of graphs with given minimum degree
    Czygrinow, A.
    Hurlbert, G.
    Katona, G. Y.
    Papp, L. F.
    DISCRETE APPLIED MATHEMATICS, 2019, 260 : 117 - 130
  • [44] On k-independence in graphs with emphasis on trees
    Blidia, Mostafa
    Chellali, Mustapha
    Favaron, Odile
    Meddah, Nacera
    DISCRETE MATHEMATICS, 2007, 307 (17-18) : 2209 - 2216
  • [45] k-independence of random variables with given distributions
    Ostrovska, S
    LIMIT THEOREMS IN PROBABILITY AND STATISTICS, VOL II, 2002, : 455 - 464
  • [46] Independence and matching number in graphs with maximum degree 4
    Joos, Felix
    DISCRETE MATHEMATICS, 2014, 323 : 1 - 6
  • [47] BIPARTITE INDEPENDENCE NUMBER IN GRAPHS WITH BOUNDED MAXIMUM DEGREE
    Axenovich, Maria
    Sereni, Jean-Sebastien
    Snyder, Richard
    Weber, Lea
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (02) : 1136 - 1148
  • [48] On the minimum Harary index of graphs with a given diameter or independence number
    Borovicanin, Bojana
    Furtula, Boris
    Jerotijevic, Marija
    DISCRETE APPLIED MATHEMATICS, 2022, 320 : 331 - 345
  • [49] Remarks on the complexity of signed k-independence on graphs
    Lee, Chuan-Min
    ARS COMBINATORIA, 2015, 123 : 303 - 315
  • [50] k-Domination and k-Independence in Graphs: A Survey
    Chellali, Mustapha
    Favaron, Odile
    Hansberg, Adriana
    Volkmann, Lutz
    GRAPHS AND COMBINATORICS, 2012, 28 (01) : 1 - 55
12345