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
来源：
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2018年 / 21卷 / 01期
关键词：
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] GENERALIZATIONS OF INDEPENDENCE AND CHROMATIC-NUMBERS OF A GRAPH
    SAMPATHKUMAR, E
    DISCRETE MATHEMATICS, 1993, 115 (1-3) : 245 - 251
  • [32] 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
  • [33] 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
  • [34] 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
  • [35] General forming of certain classes of linear operations
    Kantorovic, L
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES DE L URSS, 1936, 12 : 101 - 106
  • [36] Bounds on the Clique and the Independence Number for Certain Classes of Graphs
    Brimkov, Valentin E.
    Barneva, Reneta P.
    MATHEMATICS, 2024, 12 (02)
  • [37] THE ROBUST CHROMATIC NUMBER OF CERTAIN GRAPH CLASSES
    Bacso, Gaebor
    Bujtas, Csilla
    Patkos, Balaezs
    Tuza, Zsolt
    Vizer, Maete
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2025,
  • [38] Equitable coloring parameters of certain graph classes
    Naduvath, Sudev
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (03)
  • [39] 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
  • [40] On compact and efficient routing in certain graph classes
    Dragan, Feodor F.
    Lomonosov, Irina
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (11) : 1458 - 1470
12345