Graph labellings and external difference families
This paper establishes a systematic framework for constructing digraph-defined external difference families by combining graph blow-up techniques with generalized vertex labellings, resulting in new combinatorial families—including the first infinite construction for specific 2-circular external difference families—and novel results on graph labellings such as -valuations for sun graphs.