SUT J. Math. 48 (2), 231-240, (June 2012) DOI: 10.55937/sut/1360240564
P. Jeyanthi, A. Maheswari
KEYWORDS: cordial labeling, product cordial labeling, 3-product cordial labeling, 3-product cordial graph, 05C78
A mapping is called a 3-product cordial labeling if and for any , where denotes the number of vertices labeled with denotes the number of edges with . A graph with a 3-product cordial labeling is called a 3-product cordial graph. In this paper, we investigate the 3-product cordial behaviour for some standard graphs.