An improved lower bound on the independence number of a graph

被引：4
|
作者：
Henning, Michael A. [1 ]
Loewenstein, Christian [2 ]
机构：
[1] Univ Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa
[2] Univ Ulm, Inst Optimizat & Operat Res, D-89081 Ulm, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2014年 / 179卷
基金：
新加坡国家研究基金会;
关键词：
Independence; Vertex-cover; MAXIMUM DEGREE; TERMS; SIZE; DOMINATION; ORDER;
D O I：
10.1016/j.dam.2014.07.001
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The independence number of a graph G, denoted alpha(G), is the maximum cardinality of an independent set of vertices in G. Our main result is the strengthening of a lower bound for the independence number of a graph due to Lowenstein'et al. (2011) who proved that if G is a connected graph of order n and size m, then alpha(G) >= 2/3 n- 1/4m - 1/3. We show that if G does not belong to a specific family of graphs, then alpha(G) > in 2/3n - 1/4m. Further, we characterize the graphs G for which alpha(G) <= 2/3n - 1/4 m. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：120 / 128
页数：9
相关论文
共 50 条
  • [1] A lower bound on the independence number of a graph
    Harant, J
    DISCRETE MATHEMATICS, 1998, 188 (1-3) : 239 - 243
  • [2] LOWER BOUND FOR INDEPENDENCE NUMBER OF A PLANAR GRAPH
    ALBERTSON, MO
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 20 (01) : 84 - 93
  • [3] An Improved Bound on Weak Independence Number of a Graph
    Bhat, R. S.
    Kamath, S. S.
    Surekha
    WORLD CONGRESS ON ENGINEERING - WCE 2013, VOL I, 2013, : 208 - +
  • [4] A new lower bound on the independence number of a graph and applications
    Henning, Michael A.
    Loewenstein, Christian
    Southey, Justin
    Yeo, Anders
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
  • [5] The lower bound on independence number
    李雨生
    CecilC.ROUSSEAU
    臧文安
    Science China Mathematics, 2002, (01) : 64 - 69
  • [6] The lower bound on independence number
    Yusheng Li
    Cecil C. Rousseau
    Wen’an Zang
    Science in China Series A: Mathematics, 2002, 45 (1): : 64 - 69
  • [7] The lower bound on independence number
    Li, YS
    Rousseau, CC
    Zang, W
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2002, 45 (01): : 64 - 69
  • [8] Lower bound on independence number
    Li, Yusheng
    Rousseau, Cecil C.
    Zang, Wen'an
    Science in China, Series A: Mathematics, Physics, Astronomy, 2002, 45 (01):
  • [9] An improved lower bound for the nullity of a graph in terms of matching number
    Ma, Xiaobin
    Fang, Xianwen
    LINEAR & MULTILINEAR ALGEBRA, 2020, 68 (10): : 1983 - 1989
  • [10] A lower bound on the independence number of a graph in terms of degrees and local clique sizes
    Brause, C.
    Randerath, B.
    Rautenbach, D.
    Schiermeyer, I.
    DISCRETE APPLIED MATHEMATICS, 2016, 209 : 59 - 67
12345