Product antimagic labeling of caterpillars

DOI10.1155/2021/3493941MaRDI QIDQ2051631zbMATH OpenOpenAlexFDO

Authors Shengze Wang, Yuping Gao

Publication date 24 November 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/3493941

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

Summary: Let \(G\) be a graph with \(m\) edges. A product antimagic labeling of \(G\) is a bijection from the edge set \(E(G)\) to the set \(\{1, 2, \dots, 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 \(O(m\log m)\) algorithm.

Recommendations

• Caterpillars are antimagic
• Antimagic labelings of caterpillars
• The antimagicness of the Cartesian product of graphs
• Caterpillars with maximum degree 3 are antimagic
• Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)

Cites work

• A dynamic survey of graph labeling
• Anti-magic labeling of trees
• Antimagic labeling of cubic graphs
• Antimagic labeling of regular graphs
• Antimagic orientation of lobsters
• Antimagic orientations for the complete \(k\)-ary trees
• Antimagic orientations of disconnected even regular graphs
• Bertrand's postulate, the prime number theorem and product anti-magic graphs
• Caterpillars are antimagic
• Caterpillars have antimagic orientations
• Characterization of product anti-magic graphs of large order
• scientific article; zbMATH DE number 728185 (Why is no real title available?)
• scientific article; zbMATH DE number 1545698 (Why is no real title available?)
• Local antimagic labeling of graphs
• On zero-sum partitions and anti-magic trees

Cited in

(5)

• Antimagic labelings of caterpillars
• Caterpillars are antimagic
• Bertrand's postulate, the prime number theorem and product anti-magic graphs
• Perfectly antimagic total labeling of star-like trees and the corona product of two graphs
• Antimagic and product antimagic graphs with pendant edges

This page was built for publication: Product antimagic labeling of caterpillars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051631)