ABSTRACT. An injective function f : V (G) → {T0, T1, T2, . . . , Tn}, where n = |V (G)| − 1, is said to be a Tribonacci cordial labeling if the induced function f ∗ E(G) →{0, 1} defined by f∗(uv) = (f(u) + f(v)) mod 2 satisfies the condition |ef (0) − ef (1)| ≤ 1 where ef (0) is the number of edges with label 0 and ef (1) is the number of edges with label 1. A graph that admits a tribonacci cordial labeling is called a Tribonacci cordial graph. In this paper, we determined the Tribonacci Cordial Labeling of Triangular Snake Graph T Sn, Double Triangular Snake Graph D(T Sn), Quadrilateral Snake Graph QSn, Double Quadrilateral Snake Graph D(QSn), and Cycle Quadrilateral Snake Graph C(QSn).