--supermagic labeling of graphs

Abstract

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 study --supermagic labeling of some families of connected graphs.

Keywords

• -magic labeling
• --supermagic labeling
• --supermagic labeling