Networks and Graphs Week 1

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

No arrows are shown on the edges.

• Directed graph

• Weighted graph

• Simple graph

• Undirected graph

Tags

CCSS.HSA.REI.D.12

Every vertex in this network is (blank) to every other vertex.

• adjacent

• connected

• planar

• disconnected

Tags

CCSS.HSF-IF.C.7B

If it is possible to create a walk from one vertex to any other vertex, the network must be ...

• connected

• planar

• complete

• disjoint

Every vertex is connected to every other vertex by a single edge.

• Connected graph

• Planar graph

• Complete graph

• Disjoint graph

Identify the number of edges that connect vertex A and vertex B

• 0

• 1

• 2

• 3

Five towns, A, B, C, D and E are connected by roads. A graph of these connections, where roads are represented by edges and towns are represented by vertices, is shown below. The degree of the vertex representing town B is

• 1

• 2

• 3

• 4

• 5

Five towns, A, B, C, D and E are connected by roads. A graph of these connections, where roads are represented by edges and towns are represented by vertices, is shown below. This graph has

• one odd degree vertex and five even degree vertices

• two odd degree vertices and four even degree vertices

• three odd degree vertices and three even degree vertices

• four odd degree vertices and two even degree vertices

• five odd degree vertices and one even degree vertices

Adjacency matrices represent the number of edges that connect vertices.

• True

• False