For given graphs
![$G$](img2.png)
and
![$H,$](img3.png)
the
Ramsey number ![$R(G,H)$](img4.png)
is
the least natural number
![$n$](img5.png)
such that for every graph
![$F$](img6.png)
of order
![$n$](img5.png)
the following condition holds: either
![$F$](img6.png)
contains
![$G$](img2.png)
or the
complement of
![$F$](img6.png)
contains
![$H.$](img7.png)
In this paper, we determine the
Ramsey number of paths versus generalized Jahangir graphs. We also
derive the Ramsey number
![$R(tP_n,H)$](img8.png)
, where
![$H$](img9.png)
is a generalized
Jahangir graph
![$J_{s,m}$](img1.png)
where
![$s\geq2$](img10.png)
is even,
![$m\geq3$](img11.png)
and
![$t\geq1$](img12.png)
is any integer.