Let G be a connected graph. For any two distinct vertices x and y of G, Define a 1−1 mapping ∅: ????(????) → ???? such that ????(????, ????) + (∅(????) + 2∅(????)) ≥ 1 + ????????(????) , where ????????(????) is the diameter of G. The maximum number assigned to any vertex of G is the radio Pell number of ∅ and it is denoted by ????????????(∅). The minimum value of ????????????(∅) taken overall radio Pell labelings of G is the radio Pell number of G and it is denoted by ????????????(????). In this paper, we investigate the radio Pell number of graphs such as Comb graph ????????⨀????1 , Ladder graph ???????? , Triangular snake graph ???????? , Double Triangular snake graph ????????????, Quadrilateral snake graph ???????? and Double Quadrilateral snake graph ????????????.