Abstract:
Let G be a bipartite graph with a partite sets V1
and V2
and G′ be the copy of G with corresponding
partite sets V1
′ and V2
′ . The mirror graph M(G) of G is obtained from G and G′ by joining each vertex
of V1
to its corresponding vertex in V2
by an edge. Here we investigate E-cordial labeling of some
mirror graphs. We prove that the mirror graphs of even cycle Cn, even path Pn and hypercube Qk are
E-cordial graphs.
