In 1966 Rosa defined an α-labeling (or α-valuation) as a graceful labeling with the property that there exists an integer γ so that for each edge xy either f (x) ≤ λ < f (y) or f (y) ≤ λ < f (x). It follows that such a λmust be the smaller of the two nodes labels that yield the edge labeled 1. A simple and finite graph G(V,E) is said to be graceful if there exists an injection f:v, (G) →{0, 1, 2 ..., q) such that f' : E(G) → {1,2..., q}defined by f'(uv)=/f (u)v -f(u)-f(v)v uvϵE (G) is a bijection. The graph QS<inf>n</inf> is called Quadrilateral Snake graph. It is defined as series connection of non-Adjacent vertices of 'n' number of cycle C<inf>4</inf> and these vertex set V and edge set E have described below VQS<inf>n</inf> = {C<inf>k</inf>}n+1<inf>k=1</inf>∪{u<inf>t</inf>}n<inf>i=0</inf>∪v<inf>j</inf>}<inf>j=1</inf> E QS<inf>n</inf>={C<inf>4</inf>u<inf>k</inf>n<inf>k=1</inf>∪{C<inf>4</inf>u <inf>k</inf>n<inf>k=1</inf>{u<inf>k</inf>c<inf>k+1</inf>n<inf>k=1</inf>∪{v<inf>k</inf>c<inf>k+1</inf>n<inf>k=1</inf>A total product cordial labeling of a graph G is a function f : (V(G)∪E(G))→{0, 1}such that f(xy) =f(x)f(y) where x, y ϵV(G), xy ϵE(G) and the total number of 0 and 1 are balanced. That is, if v<inf>f</inf> (i) and e<inf>f</inf> (i) f f denote the set of nodes and edges which are labeled as i for i=0,1 respectively, then, /(v<inf>f</inf>(0)+e<inf>f</inf>(0))-(v<inf>f</inf>(1)+e<inf>f</inf>(1))≥1 we prove that (i) The graph G=P<inf>M</inf> (QS<inf>NSk</inf>)1m=0(mod2)m≥2∀<inf>n</inf>≥1,t≥1 is total product cordial graph. © 2017 Elsevier B.V., All rights reserved.