New Results on the (Super) Edge-Magic Deficiency of Chain Graphs

Ngurah Anak Agung Gede and Adiwijaya

International Journal of Mathematics and Mathematical Sciences, 2017, vol. 2017, 1-6

Abstract:

Let be a graph of order and size . An edge-magic labeling of is a bijection such that is a constant for every edge . An edge-magic labeling of with is called a super edge-magic labeling . Furthermore, the edge-magic deficiency of a graph , , is defined as the smallest nonnegative integer such that has an edge-magic labeling. Similarly, the super edge-magic deficiency of a graph , , is either the smallest nonnegative integer such that has a super edge-magic labeling or if there exists no such integer . In this paper, we investigate the (super) edge-magic deficiency of chain graphs. Referring to these, we propose some open problems.

Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2017/5156974.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2017/5156974.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:5156974

DOI: 10.1155/2017/5156974

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 ().