Title of article
Independent sets in -free 4-regular graphs
Author/Authors
Kang، نويسنده , , Liying and Wang، نويسنده , , Dingguo and Shan، نويسنده , , Erfang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
5
From page
40
To page
44
Abstract
We prove that each {claw, K 4 }-free 4-regular graph, with just one class of exceptions, is a line graph. Applying this result, we present lower bounds on the independence numbers for {claw, K 4 }-free 4-regular graphs and for {claw, diamond}-free 4-regular graphs. Furthermore, we characterize the extremal graphs attaining the bounds.
Keywords
independence number , 4-regular graph , claw-free , Cubic graph , Line graph
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600735
Link To Document