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 条
  • [31] On inertia and ratio type bounds for the k-independence number of a graph and their relationship
    Abiad, Aida
    Dalfo, Cristina
    Fiol, Miquel Angel
    Zeijlemaker, Sjanne
    DISCRETE APPLIED MATHEMATICS, 2023, 333 : 96 - 109
  • [32] New results on k-independence of graphs
    Kogan, Shimon
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (02):
  • [33] Distance domination in graphs with given minimum and maximum degree
    Henning, Michael A.
    Lichiardopol, Nicolas
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 545 - 553
  • [34] Distance domination in graphs with given minimum and maximum degree
    Michael A. Henning
    Nicolas Lichiardopol
    Journal of Combinatorial Optimization, 2017, 34 : 545 - 553
  • [35] The maximum radius of graphs with given order and minimum degree
    Kim, Byeong Moon
    Rho, Yoomi
    Song, Byung Chul
    Hwang, Woonjae
    DISCRETE MATHEMATICS, 2012, 312 (02) : 207 - 212
  • [36] New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
    Song, Haizhou
    Wang, Qiufen
    Tian, Lulu
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (09) : 2527 - 2541
  • [37] The k-independence number of direct products of graphs and Hedetniemi's conjecture
    Spacapan, Simon
    EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (08) : 1377 - 1383
  • [38] Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees
    Cheng, Xin
    Li, Xueliang
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 90 (01) : 175 - 186
  • [39] Signed total k-independence in graphs
    Volkmann, Lutz
    UTILITAS MATHEMATICA, 2017, 103 : 189 - 208
  • [40] SHARP UPPER BOUNDS ON THE CLAR NUMBER OF FULLERENE GRAPHS
    Gao, Yang
    Zhang, Heping
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) : 155 - 163
12345