3-Product Cordial Labeling of Some Graphs

Document Sample
3-Product Cordial Labeling of Some Graphs Powered By Docstoc
					International J.Math. Combin. Vol.1(2012), 96-105



                      3-Product Cordial Labeling of Some Graphs

                                                          P.Jeyanthi

               Research Centre, Department of Mathematics, Govindammal Aditanar College for Women

                                          
				
DOCUMENT INFO
Description: A mapping f : V(G) [arrow right] {0, 1, 2} is called a 3-product cordial labeling if |v^sub f^(i) - v^sub f^(j)| ≤ 1 and |e^sub f^(i) - e^sub f^(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where v^sub f^(i) denotes the number of vertices labeled with i, e^sub f^(i) denotes the number of edges xy with f(x)f(y) ≡ i (mod 3). A graph with a 3-product cordial labeling is called a 3-product cordial graph. In this paper, we establish that the duplicating arbitrary vertex in cycle C^sub n^, duplicating arbitrarily edge in cycle C^sub n^, duplicating arbitrary vertex in wheel W^sub n^, Ladder L^sub n^, Triangular Ladder TL^sub n^ and the graph [left angle bracket]W^sub n^^sup (1)^] : W^sub n^^sup (2)^) : ... : W^sub n^^sup (k)^[right angle bracket] are 3-product cordial. [PUBLICATION ABSTRACT]
BUY THIS DOCUMENT NOW PRICE: $6.95 100% MONEY BACK GUARANTEED
PARTNER ProQuest LLC
ProQuest creates specialized information resources and technologies that propel successful research, discovery, and lifelong learning.