E-cordial Labeling for Cartesian Product of Some Graphs

S. K. Vaidya, N. B. Vyas

Abstract


We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 andK1,n × P2 are E-cordial for n odd.
Key words: E-Cordial labeling; Edge graceful labeling; Cartesian product

Full Text: PDF

Refbacks

  • There are currently no refbacks.


Reminder
We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
caooc@hotmail.com; sms@cscanada.net; sms@cscanada.org

Copyright © 2010 Canadian Research & Development Center of Sciences and Cultures
Address: 758, 77e AV, Laval, Quebec, H7V 4A8, Canada

Telephone: 1-514-558 6138
Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com