A generalization of magic and antimagic labelings of graphs
A k-magic labeling of a finite, simple graph with and is a bijection from the set of edges into the integers such that the vertex set can be partitioned into sets and each vertex in the set has the same vertex sum and any two distinct vertices in different sets have different vertex sum, where a ver...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.014 |