Home   >   CSC-OpenAccess Library   >    Manuscript Information
E-Cordial Labeling of Some Mirror Graphs
S K Vaidya, N B Vyas
Pages - 22 - 27     |    Revised - 01-07-2011     |    Published - 05-08-2011
Volume - 2   Issue - 1    |    Publication Date - July / August 2011  Table of Contents
E-cordial Labeling, Edge Graceful Labeling, Mirror Graphs
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 V2 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.
CITED BY (6)  
1 Gallian, J. A. (2014). Graph labeling. The Electronic Journal of Combinatorics, 1000, DS6-Dec.
2 Suwarni, E., & Ratnasari, L. (2012). pelabelan e-cordial pada beberapa graf cermin. Jurnal Matematika, 1(1), 64-79.
3 Vaidya, S. K., & Vyas, N. B. (2012). Further results on E-cordial labeling. International Journal of Information Science and Computer Mathematics, 5(1).
4 Vaidya, S. K., & Vyas, N. B. (2012). Some results on E-cordial labeling. International journal of mathematics and scientific computing (issn: 2231-5330), 2(1).
5 Vaidya, S. K., & Vyas, N. B. (2011). E-cordial Labeling for Cartesian Product of Some Graphs. Studies in Mathematical Sciences, 3(2), 11-15.
6 Gallian, J. A. (2009). A dynamic survey of graph labeling. The electronic journal of combinatorics, 16(6), 1-219.
1 Google Scholar 
2 Google Scholar 
3 CiteSeerX 
4 refSeek 
5 Scribd 
6 SlideShare 
7 PdfSR 
A. Kotzig, On certain vertex valuations of finite graphs, Util. Math., 4(1973), 67-73.
A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (Internat. Symposium, Rome, July 1966 ), Gordon and Breach, N. Y. and Dunod Paris (1967), 349-355.
D B West. Introduction To Graph Theory, Prentice-Hall of India, 2001.
I Cahit, Cordial Graphs: A weaker version of graceful and harmonious Graphs, Ars Combinatoria, 23(1987), 201-207.
J A Gallian. A dynamic survey of graph labeling, The Electronics Journal of Combinatorics,17, #DS6 , 2010. Available: http://www.combinatorics.org/Surveys/ds6.pdf
J. Devraj, On edge-cordial graphs, Graph Theory Notes of New York, XLVII(2004), 14-18.
R. Yilmaz and I. Cahit, E-cordial graphs, Ars. Combin., 46(1997),251-266.
S. M. Lee and A. Liu, A construction of k-graceful graphs from complete bipartite graphs, SEA Bull. Math., 12(1988), 23-30.
S. W. Golomb, How to number a graph, in Graph theory and Computing, R. C. Read, ed., Academic Press, New York (1972), 23-37.
Professor S K Vaidya
Saurashtra University - India
Mr. N B Vyas
Atmiya Institute of Technology and Science - India