Neighborhood face-magic labelings of fans and ladders

Abstract

In a neighborhood face-magic labeling, we assign consecutive integer labels to the vertices, edges, and faces of a graph and the weight of each face is the sum of all labels of neighboring edges, vertices, and faces. We prove that fans and ladders admit this type of labeling. We also show that subdividing the set of edges of a graph preserves the neighborhood face-magic property.