Abstract:
Let G=(V(G),E(G)) be a graph and f E G : ( ) {0,1} → be a binary edge labeling. Define *
f V G : ( ) {0,1} → by
*
( )
( ) ( )( 2)
uv E G
f v f uv mod
∈
= ∑ . The function f is called E-cordial labeling of G if | (0) (1) | 1 f f v v − ≤ and
| (0) (1) | 1 f f e e − ≤ . In the present work we discuss E-cordial labeling in the context of switching of a vertex in cycle,
wheel, helm and closed helm
