E-Cordial Labeling in the Context of Switching of a Vertex

Vaidya, S.; Vyas, N.

dc.contributor.author	Vaidya, S.
dc.contributor.author	Vyas, N.
dc.date.accessioned	2023-05-20T02:33:25Z
dc.date.available	2023-05-20T02:33:25Z
dc.date.issued	2012
dc.identifier.citation	Vaidya, S. ,Vyas, N.(2012). E-Cordial Labeling in the Context of Switching of a Vertex. International Journal of Advanced Computer and Mathematical Sciences , ISSN 2230-9624. Vol 3, Issue 4, 2012, pp 446-452 http://bipublication.com	en_US
dc.identifier.issn	2230-9624
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1020
dc.description.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	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Advanced Computer and Mathematical Sciences	en_US
dc.subject	E-cordial labeling	en_US
dc.subject	Cycle	en_US
dc.subject	Wheel	en_US
dc.subject	Vertex switching	en_US
dc.title	E-Cordial Labeling in the Context of Switching of a Vertex	en_US
dc.type	Article	en_US