A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both multiple edges and loops.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.