Computing Edge-Weight Bounds of Antimagic Labeling on a Class of Trees
Graph labeling has wide applications in the field of computer science, such as coding theory, cryptography, software testing, database management systems, computer architecture, and networking. The computers connected in a network can now be converted in a graph and labels assigned to the graph so f...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8756168/ |