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: | Shengze Wang, Yuping Gao |
---|---|
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!
|
Similar Items
-
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
by: Martin Bača, et al.
Published: (2015-01-01) -
Cartesian Products of Some Regular Graphs Admitting Antimagic Labeling for Arbitrary Sets of Real Numbers
by: Yi-Wu Chang, et al.
Published: (2021-01-01) -
Super H-Antimagic Total Covering for Generalized Antiprism and Toroidal Octagonal Map
by: Amir Taimur, et al.
Published: (2021-01-01) -
The Cost of High Tunnel and Caterpillar Tunnel Establishment for Vegetable Production
by: Yefan Nian, et al.
Published: (2023-07-01) -
Lawn Caterpillars
by: Eileen A. Buss, et al.
Published: (2019-05-01)