On - Supermagic Labelings of - Shadow of Paths and Cycles

Ika Hesti Agustin, F. Susanto, Dafik, R. M. Prihandini, R. Alfarisi and I. W. Sudarsana

International Journal of Mathematics and Mathematical Sciences, 2019, vol. 2019, 1-7

Abstract:

A simple graph is said to be an - covering if every edge of belongs to at least one subgraph isomorphic to . A bijection is an (a,d)- - antimagic total labeling of if, for all subgraphs isomorphic to , the sum of labels of all vertices and edges in form an arithmetic sequence where , are two fixed integers and is the number of all subgraphs of isomorphic to . The labeling is called super if the smallest possible labels appear on the vertices. A graph that admits (super) - -antimagic total labeling is called (super) - -antimagic. For a special , the (super) - -antimagic total labeling is called - (super)magic labeling. A graph that admits such a labeling is called - (super)magic. The - shadow of graph , , is a graph obtained by taking copies of , namely, , and then joining every vertex in , , to the neighbors of the corresponding vertex in . In this paper we studied the - supermagic labelings of where are paths and cycles.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2019/8780329.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2019/8780329.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:8780329

DOI: 10.1155/2019/8780329

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().