No Detail Found!

On the ramsey number for paths and beaded wheels.

Author(s)
Kashif Ali Faculty of Mathematics, COMSATS Institute of Information Technology, Lahore, Pakistan
Edy Tri Baskoro Combinatorial Mathematics Research Division, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung Jalan Genesha, Bandung, Indonesia
Ioan Tomescu Faculty of Mathematics and Computer Sciences, University of Bucharest, Bucharest, Romania
Abstract
For given graphs G and H, the Ramsey number R(G,H) is the least natural number n such that for every graph F of order n the following condition holds: either F contains G or the complement of F contains H. Beaded wheel BW2,m is a graph of order 2m + 1 which is obtained by inserting a new vertex in each spoke of the wheel Wm. In this paper, we determine the Ramsey number of paths versus Beaded wheels: R(Pn,BW2,m) = 2n - 1 or 2n if m ³ 3 is even or odd, respectively, provided n ³ 2m2 - 5m + 4.
Publication Details
Page(s) 133-138
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 5, Issue: 0, Year: 2009

Request the full text from PASTIC

0

Citations

0

Downloads

69

Views