Documents
Resources
Learning Center
Upload
Plans & pricing Sign in
Sign Out
Your Federal Quarterly Tax Payments are due April 15th Get Help Now >>

3-Product Cordial Labeling of Some Graphs

VIEWS: 293 PAGES: 11

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]

More Info
To top