A graph is called a(n) ____ graph if it has no loops and no parallel edges.
A) simple
B) undirected
C) directed
D) weighted

Question

Quizplus · Accepted Answer

A simple graph is one where there are no loops (edges that connect a vertex to itself) and no parallel edges (multiple edges connecting the same two vertices). An undirected or directed graph can still have loops and/or parallel edges, and a weighted graph simply assigns numerical values to the edges, which is not mutually exclusive with having loops or parallel edges.

A Graph Is Called A(n) ____ Graph If It Has