Cartesian Products of Some Regular Graphs Admitting Antimagic Labeling for Arbitrary Sets of Real Numbers
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 inciden...
Saved in:
Main Authors: | Yi-Wu Chang, Shan-Pang Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/4627151 |
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) -
Product Antimagic Labeling of Caterpillars
by: Shengze Wang, et al.
Published: (2021-01-01) -
Connection Number- Based Topological Indices of Cartesian Product of Graphs
by: Aiman Arshad, et al.
Published: (2023-01-01) -
Eccentric Harmonic Index for the Cartesian Product of Graphs
by: Kamel Jebreen, et al.
Published: (2022-01-01) -
On the Domination Number of Cartesian Product of Two Directed Cycles
by: Zehui Shao, et al.
Published: (2013-01-01)