A cycle or Jahangir Ramsey unsaturated graphs. | [Journal of Prime Research in Mathematics • 2006]

Author(s):

1. Kashif Ali: School of Mathematical Sciences, GC University, Lahore, 68-B, New Muslim Town, Lahore, Pakistan

2. Surahmat: School of Mathematical Sciences, GC University, Lahore, 68-B, New Muslim Town, Lahore, Pakistan

3. Surahmat: Departmetn of Mathematics Education, Universitas Islam Malang, Jalan MT Haryono 193, Malang 65144, Indonesia

Abstract:

A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some result concerning both Ramsey saturated and unsaturated graph. In particular, we show that a cycle Cn and a Jahangir Jm Ramsey unsaturated or saturated graphs of R(Cn,Wm) and R(Pn,Jm), respectively. We also suggest an open problems.

Page(s): 187-193

DOI: DOI not available

Published: Journal: Journal of Prime Research in Mathematics, Volume: 2, Issue: 0, Year: 2006

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views