Gradual supermagic graphs
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we deal with special supermagic labelings of regular graphs...
| Main Author: | |
|---|---|
| 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.05.003 |
| id |
doaj-2cac8da99e094a298fd4299b2236173f |
|---|---|
| record_format |
Article |
| spelling |
doaj-2cac8da99e094a298fd4299b2236173f2020-12-17T17:28:38ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742020-01-0117122022810.1016/j.akcej.2019.05.0031759363Gradual supermagic graphsJaroslav Ivančo0Institute of Mathematics, P. J. Šafárik UniversityA graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we deal with special supermagic labelings of regular graphs and their using to construction of supermagic labelings of disconnected graphs.http://dx.doi.org/10.1016/j.akcej.2019.05.003gradual labelingsupermagic graphsdegree-magic graphs |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Jaroslav Ivančo |
| spellingShingle |
Jaroslav Ivančo Gradual supermagic graphs AKCE International Journal of Graphs and Combinatorics gradual labeling supermagic graphs degree-magic graphs |
| author_facet |
Jaroslav Ivančo |
| author_sort |
Jaroslav Ivančo |
| title |
Gradual supermagic graphs |
| title_short |
Gradual supermagic graphs |
| title_full |
Gradual supermagic graphs |
| title_fullStr |
Gradual supermagic graphs |
| title_full_unstemmed |
Gradual supermagic graphs |
| title_sort |
gradual supermagic graphs |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 2543-3474 |
| publishDate |
2020-01-01 |
| description |
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we deal with special supermagic labelings of regular graphs and their using to construction of supermagic labelings of disconnected graphs. |
| topic |
gradual labeling supermagic graphs degree-magic graphs |
| url |
http://dx.doi.org/10.1016/j.akcej.2019.05.003 |
| work_keys_str_mv |
AT jaroslavivanco gradualsupermagicgraphs |
| _version_ |
1724379085139869696 |