ABSTRACT : 
A graph with V as vertex set and E as edge set is said to have Total Sequential Cordial labeling(TSC), if there exists a mapping f : V E {0,1} such that for each (a,b) E, f(ab) =f(a) – f(b), provided the condition f(0) – f(1)≤1 is hold, where f(0) = vf(0) + ef(0) and f(1) = vf(1) +ef(1) and vf (i) , ef(i), i {0,1} are respectively, the number of vertices and edges labelled with i. In this paper we study Total Sequential Cordial Labeling for some undirected graphs.
AMS Subject Classification: 05C78
Keywords: Graph labeling,Sequential labeling, cordial labeling, Total sequential cordial labeling (TSC), Path graph,and Shadow graph.

