On the number of unlabeled vertices in edge-friendly labelings of graphs

Elliot Krop, Sin-Min Lee, Christopher Raridan

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more…