On the number of unlabeled vertices in edge-friendly labelings of $K_n$

Abstract

Given the complete graph on $n$ vertices, $K_n$, with an edge-friendly labeling, we show a label-switching algorithm producing an edge-friendly relabeling of $K_n$ such that the number of unlabeled vertices is 0.