A nonempty graph is a graph containing at least one graph edge. Equivalently, it is a graph that is not an empty graph. Thus, the singleton graph is empty rather than nonempty despite having one vertex.
For named graphs, the Wolfram Language property GraphData[graph, "Nonempty"] indicates whether the graph is nonempty.
