Product Antimagic Labeling of Caterpillars
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/3493941 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546096258220032 |
|---|---|
| author | Shengze Wang Yuping Gao |
| author_facet | Shengze Wang Yuping Gao |
| author_sort | Shengze Wang |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-e6d7606854ea4d419093e3c26f9ff2cf |
| institution | Kabale University |
| issn | 2314-4629 2314-4785 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-e6d7606854ea4d419093e3c26f9ff2cf2025-02-03T07:24:00ZengWileyJournal of Mathematics2314-46292314-47852021-01-01202110.1155/2021/34939413493941Product Antimagic Labeling of CaterpillarsShengze Wang0Yuping Gao1School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, ChinaSchool of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, ChinaLet 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.http://dx.doi.org/10.1155/2021/3493941 |
| spellingShingle | Shengze Wang Yuping Gao Product Antimagic Labeling of Caterpillars Journal of Mathematics |
| title | Product Antimagic Labeling of Caterpillars |
| title_full | Product Antimagic Labeling of Caterpillars |
| title_fullStr | Product Antimagic Labeling of Caterpillars |
| title_full_unstemmed | Product Antimagic Labeling of Caterpillars |
| title_short | Product Antimagic Labeling of Caterpillars |
| title_sort | product antimagic labeling of caterpillars |
| url | http://dx.doi.org/10.1155/2021/3493941 |
| work_keys_str_mv | AT shengzewang productantimagiclabelingofcaterpillars AT yupinggao productantimagiclabelingofcaterpillars |