Supermagic Graphs with Many Different Degrees

Supermagic Graphs with Many Different Degrees

Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . . , a + e − 1} such that for every vertex v ∈ V the sum of labels of all adjacent edges equals the same constant k. This k is cal...

Full description

Bibliographic Details
Main Authors: Kovář Petr, Kravčenko Michal, Silber Adam, Krbeček Matěj
Format: Article
Language:English
Published: Sciendo 2021-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
graph labeling
supermagic labeling
non-regular graphs
05c70
05c78
Online Access:https://doi.org/10.7151/dmgt.2227
id doaj-657c4c57a7464968a77532949910dd83
record_format Article
spelling doaj-657c4c57a7464968a77532949910dd832021-09-05T17:20:25ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922021-11-014141041105010.7151/dmgt.2227Supermagic Graphs with Many Different DegreesKovář Petr0Kravčenko Michal1Silber Adam2Krbeček Matěj3Department of Applied Mathematics and The IT4Innovations National Supercomputing CenterVŠB – Technical University of Ostrava708 33 Ostrava-Poruba, Czech RepublicDepartment of Applied Mathematics and The IT4Innovations National Supercomputing CenterVŠB – Technical University of Ostrava708 33 Ostrava-Poruba, Czech RepublicDepartment of Applied Mathematics and The IT4Innovations National Supercomputing CenterVŠB – Technical University of Ostrava708 33 Ostrava-Poruba, Czech RepublicDepartment of Applied Mathematics, VŠB – Technical University of Ostrava708 33 Ostrava-Poruba, Czech RepublicLet G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . . , a + e − 1} such that for every vertex v ∈ V the sum of labels of all adjacent edges equals the same constant k. This k is called a magic constant of f, and G is a supermagic graph.https://doi.org/10.7151/dmgt.2227graph labelingsupermagic labelingnon-regular graphs05c7005c78
collection DOAJ
language English
format Article
sources DOAJ
author Kovář Petr
Kravčenko Michal
Silber Adam
Krbeček Matěj
spellingShingle Kovář Petr
Kravčenko Michal
Silber Adam
Krbeček Matěj
Supermagic Graphs with Many Different Degrees
Discussiones Mathematicae Graph Theory
graph labeling
supermagic labeling
non-regular graphs
05c70
05c78
author_facet Kovář Petr
Kravčenko Michal
Silber Adam
Krbeček Matěj
author_sort Kovář Petr
title Supermagic Graphs with Many Different Degrees
title_short Supermagic Graphs with Many Different Degrees
title_full Supermagic Graphs with Many Different Degrees
title_fullStr Supermagic Graphs with Many Different Degrees
title_full_unstemmed Supermagic Graphs with Many Different Degrees
title_sort supermagic graphs with many different degrees
publisher Sciendo
series Discussiones Mathematicae Graph Theory
issn 2083-5892
publishDate 2021-11-01
description Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . . , a + e − 1} such that for every vertex v ∈ V the sum of labels of all adjacent edges equals the same constant k. This k is called a magic constant of f, and G is a supermagic graph.
topic graph labeling
supermagic labeling
non-regular graphs
05c70
05c78
url https://doi.org/10.7151/dmgt.2227
work_keys_str_mv AT kovarpetr supermagicgraphswithmanydifferentdegrees
AT kravcenkomichal supermagicgraphswithmanydifferentdegrees
AT silberadam supermagicgraphswithmanydifferentdegrees
AT krbecekmatej supermagicgraphswithmanydifferentdegrees
_version_ 1717786358026600448

Similar Items