U1. Basic concepts

The ___ of a graph is its number of nodes.

• size

• order

• lenght

• magnitude

If e = (u, v) is an edge of of a graph, u and v are:

• undirected

• friends

• neighbours

• isolated

The ___ graph of a digraph is a graph obtained by "removing"

direction from its edges.

• subgraph

• non-directed

• bidirected

• underlying

• multigraph

The sequence (v3, v4, v5) is:

• A cycle

• A path

• A circuit

• A triangle

The sequence (v1, v4, v2, v1) is:

• A cycle

• A path

• A circuit

• A triangle

• None of the previous

The ___ between two nodes is the length of its shortest path.

• distance

• length

• adjacency

• geodesic

• eulerian

Add edges to this graph so that it has 3 connected components

A(n) ___ graph is a graph where each pair of nodes is adjacent.

• empty

• k-regular

• subgraph

• complete

An n-node tree:

• May have many connected components

• Doesn't have cycles

• Has n edges

• Is not bipartite

A representation based on the adjacency matrix:

• Is adequate to store dense graphs

• Is adequate to store sparse graphs

• Can not be used for directed graphs

• Is always better than edge list