Enumeration of the Edge Weights of Symmetrically Designed Graphs
The idea of super a,0-edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super a,0-edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/8335054 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The idea of super a,0-edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super a,0-edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of C4 and different trees. Several problems shall also be addressed in this article. |
|---|---|
| ISSN: | 2314-4629 2314-4785 |