Let G be a rooted product graph of path with a cycle graph with the vertex set V and the edge set E. Here n P be a Path with n vertices and m C (3) m ≥ be a cycle with a sequence of n rooted graphs m1 m2 m3 mn C ,C ,C ,-,C. We call n m P (C) the rooted product of n P by m C and it is denoted by n m P C o. Every i th vertex of n P is merging with any one vertex in every i th copy of m C. In this paper we discuss some results on rooted product graph of path with a cycle graph.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.