Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1017
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S.-
dc.contributor.authorVyas, N.-
dc.date.accessioned2023-05-18T06:18:14Z-
dc.date.available2023-05-18T06:18:14Z-
dc.date.issued2011-11-
dc.identifier.citationVaidya, 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.175en_US
dc.identifier.issn1923-8444-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1017-
dc.description.abstractWe 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.isoenen_US
dc.publisherStudies in Mathematical Sciences, CSCanadaen_US
dc.subjectE-Cordial labelingen_US
dc.subjectEdge graceful labelingen_US
dc.subjectCartesian producten_US
dc.titleE-Cordial Labeling for Cartesian Product of Some Graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
892) 13056_Nirav Bipinkumar Vyas.pdf470.45 kBAdobe PDFView/Open
Show simple item record


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