The connection between the magical coloring of trees
Let $ f $ be a set-ordered edge-magic labeling of a graph $ G $ from $ V(G) $ and $ E(G) $ to $ [0, p-1] $ and $ [1, p-1] $, respectively; it also satisfies the following conditions: $ |f(V(G))| = p $, $ \max f(X) < \min f(Y) $, and $ f(x)+f(y)+f(xy) = C $ for each edge $ xy\in E(G) $. In thi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2024-09-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20241354?viewType=HTML |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|