On the edge irregularity strength of grid graphs
For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of . The minimum for which the graph has an edge irregular -labeling is called the edge irregularity strength of , den...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.06.011 |