Operations on independence numbers of certain graph classes

被引:2
|
作者
Susanth, C. [1 ]
Kalayathankal, Sunny Joseph [2 ]
机构
[1] Bharathiar Univ, Dept Math, Res & Dev Ctr, Coimbatore 641046, Tamil Nadu, India
[2] Kuriakose Elias Coll, Dept Math, Kottayam 686561, Kerala, India
关键词
Independence number; matching number; Graph Complement;
D O I
10.1080/09720529.2016.1165414
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, we study the operations on the Independence numbers of graphs with their complement. We also provide a new characterization of certain graph classes.
引用
收藏
页码:75 / 82
页数:8
相关论文
共 50 条
  • [31] On the Maximum Clique and the Maximum Independence Numbers of a Graph
    Maden, A. Dilek
    Buyukkose, Serife
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS A-C, 2011, 1389
  • [32] GENERALIZATIONS OF INDEPENDENCE AND CHROMATIC-NUMBERS OF A GRAPH
    SAMPATHKUMAR, E
    DISCRETE MATHEMATICS, 1993, 115 (1-3) : 245 - 251
  • [33] On Stability of the Independence Number of a Certain Distance Graph
    Ogarok, P. A.
    Raigorodskii, A. M.
    PROBLEMS OF INFORMATION TRANSMISSION, 2020, 56 (04) : 345 - 357
  • [34] ON THE MAXIMAL INDEPENDENCE POLYNOMIAL OF CERTAIN GRAPH CONFIGURATIONS
    Hu, Han
    Mansour, Toufik
    Song, Chunwei
    ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2017, 47 (07) : 2219 - 2253
  • [35] On Stability of the Independence Number of a Certain Distance Graph
    P. A. Ogarok
    A. M. Raigorodskii
    Problems of Information Transmission, 2020, 56 : 345 - 357
  • [36] General forming of certain classes of linear operations
    Kantorovic, L
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES DE L URSS, 1936, 12 : 101 - 106
  • [37] Bounds on the Clique and the Independence Number for Certain Classes of Graphs
    Brimkov, Valentin E.
    Barneva, Reneta P.
    MATHEMATICS, 2024, 12 (02)
  • [38] THE ROBUST CHROMATIC NUMBER OF CERTAIN GRAPH CLASSES
    Bacso, Gaebor
    Bujtas, Csilla
    Patkos, Balaezs
    Tuza, Zsolt
    Vizer, Maete
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2025,
  • [39] Equitable coloring parameters of certain graph classes
    Naduvath, Sudev
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (03)
  • [40] A study on the curling number of certain graph classes
    Susantht, C.
    Sudev, N.K.
    Chithra, K.P.
    Kalayathankal, Sunny Joseph
    Kok, Johan
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 108 : 89 - 97