The graph is called a Quadrilateral Snake graph. Which is defined as series connection of non-adjacent vertices of 'N' number of cycle and these vertex set and edge set are described below V(QS<N>) = (c<k>)<k=1>N+1 ∪ (u<i>)<i=1>N ∪ (v<j>) <j=1> N E(QS<N>) = (c<k>u<k>)<k=1>N) ∪ (c<k>v<k>)<k=1>N) ∪ (u<k>c<k+1>)<k=1>N ∪ (v<k>c<k+1>)<k=1>N A prime cordial labeling of a graph G with vertex set V(G) is a bijection such that each edge is assigned the label 1 if and 0 if then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this paper we prove that the graphsG<1> = P<m>(QS<n>), m≡ 0(mod2),∀n ≥1 and G<2> =B<m,n> (QS<N>),m,n ≥ 2, m=n,N ≥1 are prime cordial. © 2020 Elsevier B.V., All rights reserved.