For given graphs

and

the
Ramsey number 
is
the least natural number

such that for every graph

of order

the following condition holds: either

contains

or the
complement of

contains

In this paper, we determine the
Ramsey number of paths versus generalized Jahangir graphs. We also
derive the Ramsey number

, where

is a generalized
Jahangir graph

where

is even,

and

is any integer.