--supermagic labeling of graphs
A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be -magic if there exists a total labeling such that for every subgraph of isomorphic to , is constant. Additionally, the labeling is called - supermagic labeling if . In this paper, we...
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.03.016 |