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

Keywords


E-Cordial labeling; Edge graceful labeling; Cartesian product

Full Text:

PDF


DOI: http://dx.doi.org/10.3968/j.sms.1923845220110302.175

DOI (PDF): http://dx.doi.org/10.3968/g2237

Refbacks

  • There are currently no refbacks.


Copyright (c)




Share us to:   


Please send your manuscripts to sms@cscanada.net,or  sms@cscanada.org  for consideration. We look forward to receiving your work.

 

 Articles published in Studies in Mathematical Sciences are licensed under Creative Commons Attribution 4.0 (CC-BY).

 STUDIES IN MATHEMATICAL SCIENCES Editorial Office

Address: 1055 Rue Lucien-L'Allier, Unit #772, Montreal, QC H3G 3C4, Canada.

Telephone: 1-514-558 6138

Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com

Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures