Handicap Labelings of 4-Regular Graphs
Let G be a simple graph, let <i> f : V(G)→{1,2,...,|V(G)|}</i> be a bijective mapping. The weight of <i>v ∈ V(G)</i> is the sum of labels of all vertices adjacent to <i>v</i>. We say that <i>f</i> is a distance magic labeling of <i...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
VSB-Technical University of Ostrava
2017-01-01
|
| Series: | Advances in Electrical and Electronic Engineering |
| Subjects: | |
| Online Access: | http://advances.utc.sk/index.php/AEEE/article/view/2263 |