Title of article
UPPER BOUNDS FOR THE SIZE RAMSEY P3 VERSUS C3^t OR Pn
Author/Authors
BASKORO، E.T. نويسنده , , NURAENI، Y. نويسنده , , NGURAH، A.A.G. نويسنده ,
Issue Information
سالنامه با شماره پیاپی 1 سال 2006
Pages
6
From page
141
To page
146
Abstract
In this paper, we derive an upper bound for the size Ramsey number for a path P3 versus a friendship graph C3^t . Furthermore, some minimal Ramsey graph for a combination (P3;C3^t ) is presented. We also give an upper bound of the size Ramsey number for P3 versus Pn.
Journal title
Journal of Prime Research in Mathematics
Serial Year
2006
Journal title
Journal of Prime Research in Mathematics
Record number
187452
Link To Document