Document Type
Article
Publication Date
2017
Journal Title
Congressus Numerantium
Volume
228
Abstract
We assign the labels {0,1,2,3} to the vertices of a graph; each edge is assigned the absolute difference of the incident vertices’ labels. For the labeling to be 4−equitable, we require the edge labels and vertex labels to each be distributed as uniformly as possible.
We study 4−equitable labelings of different trees and prove all cater-pillars, symmetric generalized n−stars (or symmetric spiders), and complete n −ary trees for all n ∈ N are 4−equitable.
Recommended Citation
Z. Coles*, A. Huszar*, J. Miller*, Z. Szaniszlo (2017). 4-equitable tree labeling, Congressus Numerantium 228 (2017), 51-63
COinS
