Cartesian Products of Some Regular Graphs Admitting Antimagic Labeling for Arbitrary Sets of Real Numbers

Yi-Wu Chang, Shan-Pang Liu and M. M. Bhatti

Journal of Mathematics, 2021, vol. 2021, 1-8

Abstract: An edge labeling of graph G with labels in A is an injection from EG to A, where EG is the edge set of G, and A is a subset of â„ . A graph G is called â„ -antimagic if for each subset A of â„ with A=EG, there is an edge labeling with labels in A such that the sums of the labels assigned to edges incident to distinct vertices are different. The main result of this paper is that the Cartesian products of complete graphs (except K1) and cycles are â„ -antimagic.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/4627151.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/4627151.xml (application/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:jjmath:4627151

DOI: 10.1155/2021/4627151

Access Statistics for this article

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