DSpace Repository
Duplicating a Vertex with an Edge in Divided Square Difference Cordial Graphs
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Alfred Leo, A. | |
| dc.contributor.author | Vikramaprasad, R | |
| dc.date.accessioned | 2022-06-07T07:54:34Z | |
| dc.date.available | 2022-06-07T07:54:34Z | |
| dc.date.issued | 2018-09-06 | |
| dc.identifier.issn | 2278-9561 | |
| dc.identifier.issn | 2278-957X | |
| dc.identifier.uri | http://dspace.chitkarauniversity.edu.in/xmlui/handle/123456789/465 | |
| dc.description.abstract | In this present work, we discuss divided square difference (DSD) cordial labeling in the context of duplicating a vertex with an edge in DSD cordial graphs such as path graph, cycle graph, star graph, wheel graph, helm graph, crown graph, comb graph and snake graph. | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | ;CHAENG/2013/49583 | |
| dc.subject | duplication of a vertex by an edge | en_US |
| dc.subject | cycle graph | en_US |
| dc.title | Duplicating a Vertex with an Edge in Divided Square Difference Cordial Graphs | en_US |
| dc.type | Article | en_US |
