We introduce Tribonacci cordial labeling as an extension of Fibonacci cordial labeling, a well-known form of vertex-labelings. A graph that admits Tribonacci cordial labeling is called Tribonacci cordial graph. In this paper we investigate whether some well-known graphs are Tribonacci cordial.