TYPES OF GRAPH

Question 1

UNDIRECTED GRAPH:

-Each edge connects 2 distinct vertices and no 2 edges
connect same pair of vertices.

-For a _________ G of a given order n, the maximum value
of m is [n(n-1)]/2 .

Answer 1

SIMPLE GRAPH G(V,E)

simple graph

Question 2

The edges e1 and e2 are called multiple or parallel edges if
G(e1)=G(e2).

A _________ consists of vertices and undirected edges
between these vertices, with multiple edges between pairs of
vertices allowed.

Every simple graph is also _______.

Not all __________ are simple graphs.

Answer 2

MULTIGRAPH G(V,E)

multigraph/s

Question 3

A graph that consists loops. The edges of loops are from a
vertex to the same vertex. Thus, if an edge “e” is a loop,
then G(e)={u,u} where u is a vertex in the graph.

Answer 3

PSEUDOGRAPH G(V,E)

Question 4

A __________ consists of a set of vertices V and a set of
edges E that are ordered pairs of elements of V.

The edges of a ___________are ordered pairs.

Loops, ordered pairs of same element are _______, but multiple edges in the same
direction between two vertices are _______.

Answer 4

directed simple graph G(V,E)

directed graph

allowed
not allowed

Question 5

A __________ consists of a set of vertices V and a set of
edges E that are ordered pairs of elements of V. The edges e1 and e2 are
multiple edges if G(e1)=G(e2).

__________ have multiple directed edges from a vertex to a second (possibly
the same vertex, or loop).

(u,v) is an edge of G(V,E) as long as there is at least one edge e with G(e)=(u,v).

Answer 5

directed multigraph G(V,E)