A generalization of magic and antimagic labelings of graphs
A k-magic labeling of a finite, simple graph with |V(G)|=p and |E(G)|=q, is a bijection from the set of edges into the integers {1,2,3,…,q}such that the vertex set V can be partitioned into k sets V1,V2,V3,…,Vk,1≤k≤p, and each vertex in the set Vihas the same vertex sum and any two distinct vertices...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016301001 |