Connectivity of natural modular graphs (Q1968554)

A natural modular graph \((V,E)\) is defined by two sets of integers, \(V\) and \(U\), such that any two vertices \(x,y \in V\) are adjacent if and only if \(|x-y|\in U\). The natural modular graph defined by \([n]\) and \(U\) is connected if and only if \(\text{gcd}(U) = 1\) and \(\sum U \leq (|U|-1) \cdot n + 1\).