Journal of Prime Research in Mathematics
Vol. 1 (2006), Issue 1, pp. 187 – 193
ISSN: 1817-3462E (Online) 1818-5495 (Print)
ISSN: 1817-3462E (Online) 1818-5495 (Print)
A cycle or Jahangir ramsey unsaturated graphs
Kshif Ali
School of Mathematical Science, GC University, Lahore, 68-B, New Muslim Town,
Lahore, Pakistan.
Surahmat
Department of Mathematics Education, Universitas Islam Malang, Jalan MT Haryono 193, Malang 65144, Indonesia.
\(^{1}\)Corresponding Author: akashif@sms.edu.pk.
Copyright © 2006 Kashif Ali, Surahmat. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Published: December, 2006.
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 \(C_{n}\) and a Jahangir \(J_{m}\) Ramsey unsaturated or saturated graphs of \(R(C_n, W_m)\) and \(R(P_n, J_m)\), respectively. We also suggest an open problems.
Keywords:
Ramsey number, cycle, wheel, Jahangir, unsaturated.