Question

what is meant by a single graph​

Answer 1

Answer:

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. ... A simple graph with multiple edges is sometimes called a multigraph (Skiena 1990, p. 89).

Step-by-step explanation:

Mark it as a brainliest