On total labelings of graphs with prescribed weights
Let G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic total labeling of G is a bijection f from V(G)∪E(G) onto the set of consecutive integers {1,2,…,|V(G)|+|E(G)|}, such that all the edge weights or vertex weights are equal to a constant, respectively. When all...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2016-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016300251 |