Question

A simple graph can have _______

(a) multiple edges

(b) self loops

(c) parallel edges

(d) no multiple edges, self-loops and parallel edges

This question was addressed to me in an interview.

This intriguing question comes from Graphs topic in portion Graphs of Discrete Mathematics

Answer 1

The correct option is (d) no multiple edges, self-loops and parallel edges

Easiest explanation: If a graph say G = <V, E> has no parallel or multiple edges and no self loops contained in it is called a simple graph. An undirected graph may have multiple edges and self-loops.