On Ramsey numbers : of Path versus wheel-like graphs

ISBN-13: 9783838323961 / Angielski / Miękka / 2009 / 72 str.

Kashif Ali

Opis

For any two graphs G and H, there exists a least positive integer R(G;H), such that every graph say F of order R(G;H) satisfies the following condition: either F contains G as a subgraph or the complement of F contains H. This book studies the determination of Ramsey number for a combination of path P_n and a wheel-like graph. What we mean by wheel-like graph, is a graph obtained from a wheel by a graph operation such as deletion or subdivision of the spoke edges. The classes of wheel-like graphs which we consider are Jahangir graph, generalized Jahangir graph and beaded wheel.

O autorze

My Name is Kashif Ali and I have completed my Phd (Mathematics)from Abdus Salam School of Mathematical Sciences, Government College University, Lahore, Pakistan under the supervision of Prof. Dr. Edy Tri Baskoro, in 2008. MY Area of interest is Graph Theory. Currently, I am working as Assistant Professor at CIIT Lahore, Pakistan.