Basic

Question 1

If all the vertices of G are pairwise adjacent then G is

Answer 1

Complete

Question 2

One of the most important properties of a vertex in a graph is its degree, defined as

Answer 2

The total number of edges incident to that vertex

Question 3

In a directed graph, the degree of a vertex Vi is split into

Answer 3

(1) the in-degree of the vertex, defined as the number of edges for which Vi is their end node (the head of the arrow) , and (2) the out-degree of the vertex, which is the number of edges for which Vi is their start node (the tail of the arrow).

Question 4

There are two standard ways for representing a graph G (V, E) in a suitable way to be processed:

Answer 4

as a collection of adjacency list or as an adjacency matrix

Question 5

A disadvantage of the adjacency-list representation is that it provides no quicker way to determine whether a given edge Euv is present in the graph than to search for v in the adjacency list Adj[u]. An adjacency-matrix representation of the graph remedies this disadvantage, but at the cost of

Answer 5

using asymptotically more memory.