Complete graphs with zero, one, two, or three vertices would be ambiguously categorized (fit in overlap of both sides).
Left examples are called "fully connected graphs." Right examples are called "cycle graphs."
Adjacent-numbered pages: BP927 BP928 BP929 BP930 BP931  *  BP933 BP934 BP935 BP936 BP937
precise, left-narrow, right-narrow, both, preciseworld
connected_graph [smaller | same | bigger]
Aaron David Fairbanks