E-Cordial Labeling of Some Mirror Graphs

Vaidya, S.; Vyas, N.

dc.contributor.author	Vaidya, S.
dc.contributor.author	Vyas, N.
dc.date.accessioned	2023-05-20T02:09:57Z
dc.date.available	2023-05-20T02:09:57Z
dc.date.issued	2011
dc.identifier.citation	Vaidya, S. ,Vyas, N.(2011). E-Cordial Labeling of Some Mirror Graphs . International Journal of Contemporary Advanced Mathematics (IJCM), Volume (2) : Issue (1), 22-27, ISSN : 2180-0030, https://www.cscjournals.org/download/issuearchive/IJCM/Volume2/IJCM_V2_I1.pdf	en_US
dc.identifier.issn	2180-0030
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1018
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Contemporary Advanced Mathematics (IJCM)	en_US
dc.subject	E-Cordial labeling	en_US
dc.subject	Edge graceful labeling	en_US
dc.subject	Mirror graphs	en_US
dc.title	E-Cordial Labeling of Some Mirror Graphs	en_US
dc.type	Article	en_US