Question

iii. A graph that has neither self-loops nor parallel edges is called a
a. simple graph b. multi graph
c. Digraph d. none of these
on more than once is called​

Answer 1

Answer:

A simple graph is the answer for your question.

Answer 2

Answer:

the answer is simple graph

the definition of simple graph

In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called vertices and each of the related pairs of vertices is called an edge