On group vertex magic graphs
Let be a simple undirected graph and let be an additive abelian group with identity 0. A mapping is said to be a -vertex magic labeling of if there exists an element of such that for any vertex of , where is the open neighborhood of A graph that admits such a labeling is called an -vertex magic grap...
| 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.2019.04.001 |
| Summary: | Let be a simple undirected graph and let be an additive abelian group with identity 0. A mapping is said to be a -vertex magic labeling of if there exists an element of such that for any vertex of , where is the open neighborhood of A graph that admits such a labeling is called an -vertex magic graph. If is -vertex magic graph for any nontrivial abelian group , then is called a group vertex magic graph. In this paper, we obtain a few necessary conditions for a graph to be group vertex magic. Further, when , we give a characterization of trees with diameter at most 4 which are -vertex magic. |
|---|---|
| ISSN: | 0972-8600 2543-3474 |