Vaidya, S.; Vyas, N.
(International Journal of Advanced Computer and Mathematical Sciences, 2012)
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 | ...