Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1018
Title: E-Cordial Labeling of Some Mirror Graphs
Authors: Vaidya, S.
Vyas, N.
Keywords: E-Cordial labeling
Edge graceful labeling
Mirror graphs
Issue Date: 2011
Publisher: International Journal of Contemporary Advanced Mathematics (IJCM)
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
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.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1018
ISSN: 2180-0030
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
893) 13056_Nirav Bipinkumar Vyas.pdf1.16 MBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.