Network in Graph Theory

Choose the FALSE statement from the statements below.

• A node is also known as a vertex.

• A link is also known as an edge.

• A loop is counted as two edges.

• The order of a graph is the total number of vertices of the graph.

State the number of vertices.

• 14

• 3.5

• 7

• 5

Tags

CCSS.6.G.A.4

Determine the sum of degrees.

• 16

• 8

• 4

• 13

State Σd(V) .

• 5

• 7

• 10

• 14

Which of the statements below is not true

• V = {P, Q, R, S, T, U}

• E = {(R,S), (S,T), (T,U), (U,P), (P,Q)}

• d(R) = 3

• sum of degree = 18

The following undirected graph shows six houses in a village. A salesperson needs to visit all

the houses starting from house A and finishing at house F. Calculate the shortest distance in km.

• 3.05

• 3.08

• 3.30

• 3.68

Choose the correct term to match each definition: Lines or curves that connect vertices.

• Regions

• Vertices

• Edges

• Paths

Tags

CCSS.HSG.CO.A.1

An edge that begins and ends at the same vertex.

• Multiple edges

• Vertices

• Loop

• Node

When the edges have a numerical representation (to indicate length, time, capacity etc.).

• Multiple edges

• Weighted graph

• Complete graph

• Directed graph

An undirected and unweighted graph with no multiple edges.

• Undirected graph

• Unweighted graph

• Incomplete graph

• Simple graph