Product Antimagic Labeling of Caterpillars

Shengze Wang, Yuping Gao and Efthymios G. Tsionas

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

Abstract: Let G be a graph with m edges. A product antimagic labeling of G is a bijection from the edge set EG to the set 1,2,…,m such that the vertex-products are pairwise distinct, where the vertex-product of a vertex v is the product of labels on the incident edges of v. A graph is called product antimagic if it admits a product antimagic labeling. In this paper, we will show that caterpillars with at least three edges are product antimagic by an Om  log  m algorithm.

Date: 2021
References: Add references at CitEc
Citations:

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

DOI: 10.1155/2021/3493941

Access Statistics for this article

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