E-Cordial Labeling for Cartesian Product of Some Graphs

Vaidya, S.; Vyas, N.

dc.contributor.author	Vaidya, S.
dc.contributor.author	Vyas, N.
dc.date.accessioned	2023-05-18T06:18:14Z
dc.date.available	2023-05-18T06:18:14Z
dc.date.issued	2011-11
dc.identifier.citation	Vaidya, S. ,Vyas, N.(2019). E-Cordial Labeling for Cartesian Product of Some Graphs. Studies in Mathematical Sciences, CSCanada, Vol. 3, No. 2, 2011, pp. 11-15, ISSN 1923-8444 [Print] ISSN 1923-8452 [Online], DOI: 10.3968/j.sms.1923845220110302.175	en_US
dc.identifier.issn	1923-8444
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1017
dc.description.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 and K1,n × P2 are E-cordial for n odd.	en_US
dc.language.iso	en	en_US
dc.publisher	Studies in Mathematical Sciences, CSCanada	en_US
dc.subject	E-Cordial labeling	en_US
dc.subject	Edge graceful labeling	en_US
dc.subject	Cartesian product	en_US
dc.title	E-Cordial Labeling for Cartesian Product of Some Graphs	en_US
dc.type	Article	en_US