Vertex equitable labeling of graphs
M. Seenivasan, A. Lourdusamy · Journal of Discrete Mathematical Sciences and Cryptography · 2008
We introduce a new type of labeling known as vertex equitable labeling. We study the Properties of this labeling and we investigate vertex equitable behaviors of some standard graphs. We also prove that arbitrary supersubdivision of paths is vertex equitable and that every cycle C n with n ≡ 0 or 3 (mod 4) has a vertex equitable superdivision.