Two constructions of -antimagic graphs
Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the edges and vertices belonged to constitute the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2016.11.004 |
| Summary: | Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the edges and vertices belonged to constitute the arithmetic progression with the initial term and the common difference . Such a graph is called super if . In this paper, we provide two constructions of (super) -antimagic graphs obtained from smaller (super) -antimagic graphs. |
|---|---|
| ISSN: | 0972-8600 |