Networks Basics Revision

Is this diagram correctly labelled?

• Yes

• No

What is the degree of Vertex A?

• 2

• 3

• 4

• 5

What is the degree of Vertex C?

• 2

• 3

• 4

• 5

What is the degree of Vertex E?

• 2

• 3

• 4

• 5

Determine the adjacency matrix for this network:

• 
• 
• 
• 

In a network a Walk is any route taken through a network, including routes that repeat edges and vertices. What is a Trail?

• A walk in which no vertices are repeated, except possibly the start and finish

• A walk in which no edges are repeated and start and end at different vertices

What is a Eulerian Trail?

• A trail in a graph that visits every edge exactly once and does not return to the start.

• A trail in a graph that visits every vertex exactly once and returns to the start.

• A walk beginning and ending at the same vertex.

What is a Hamiltonian Cycle?

• A path in a graph that visits every edge exactly once and returns to the start.

• A path in a graph that visits every vertex exactly once and returns to the start.

• A path beginning and ending at the same vertex.

What is an Eulerian Circuit ?

• A trail in a graph that visits every edge exactly once returning to the start.

• A trail in a graph that visits every edge exactly once without returning to the start.

• A path beginning and ending at the same vertex.

What is a Hamiltonian Path?

• A path in a graph that visits every edge exactly once returning to the start.

• A path in a graph that visits every vertex exactly once without returning to the start.

• A path beginning and ending at the same vertex.