On the number of unlabeled vertices in edge-friendly labelings of $K_n$
No Thumbnail Available
Authors
Elliot Krop
Christopher Raridan
Sin-Min Lee
Issue Date
Type
Journal Article, Academic Journal
Language
Keywords
Alternative Title
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.