The Sum and Product of Independence Numbers of Graphs and their Line Graphs

被引:0
作者
Susanth, C. [1 ]
Kalayathankal, Sunny Joseph [2 ]
机构
[1] Bharathiar Univ, Res & Dev Ctr, Coimbatore 641046, Tamil Nadu, India
[2] Kuriakose Elias Coll, Dept Math, Kottayam 686561, Kerala, India
来源
JOURNAL OF INFORMATICS AND MATHEMATICAL SCIENCES | 2014年 / 6卷 / 02期
关键词
Independence number; Matching number; Line graph;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 bounds on the sum and product of the independence numbers of graphs and their line graphs. We also provide a new characterization of the certain graph classes.
引用
收藏
页码:77 / 85
页数:9
相关论文
共 12 条
[1]  
[Anonymous], 2000, GRAPH THEORY
[2]  
Bondy J. A., 2008, GRAPH THEORY
[3]  
Brandstadt A., 1999, GRAPH CLASSES SURVEY
[4]  
Brouwer A.E., 1989, DISTANCE REGULAR GRA
[5]  
Chartrand G., CHROMATIC GRAPH THEO
[6]  
Clark J., 1991, 1 LOOK GRAPH THEORY
[7]  
Collins KL, 2009, ELECTRON J COMB, V16
[8]  
Deo Narsingh, 1974, GRAPH THEORY APPL EN
[9]  
Gallian J. A., 2011, ELECT J COMBINATORIC, V18
[10]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364