Total Difference Labeling of Regular Infinite Graphs

Noam Benson-Tilsen, Samuel Brock, Brandon Faunce +3

Given a graph $G$, a \textit{$k$-total difference labeling} of the graph is a total labeling $f$ from the set of edges and vertices to the set $\{1,2,\cdots k\}$ satisfying that…