We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
3-Product Cordial Labeling of Star Graphs.
- Authors
Jeyanthi, P.; Maheswari, A.
- Abstract
A mapping f : V (G) → {0; 1; 2} is called 3-product cordial labeling if |vf(i)-vf(j)| ≤ 1 and |ef (i)-ef (j)| ≤ 1 for any i; j ∈ {0; 1; 2}; where vf(i) denotes the number of vertices labeled with i;ef(i) denotes the number of edges xy with f(x)f(y) ≡ i (mod 3): A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper, we establish that the splitting graphs S'(K1,n); S'(Bn,n); B*n,n and the shadow graph D2(Bn,n) are 3-product cordial graphs.
- Subjects
STAR graphs (Graph theory); MATHEMATICAL mappings; NUMBER theory; MATHEMATICAL proofs; NUMERICAL analysis
- Publication
Southeast Asian Bulletin of Mathematics, 2015, Vol 39, Issue 3, p429
- ISSN
0129-2021
- Publication type
Article