Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Networks - Lesson 3

Total questions: 58

Worksheet time: 32mins

Name
Class
Date
1.

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

a)

Regions

b)

Vertices

c)

Edges

d)

Paths

2.

An edge that begins and ends at the same vertex.

a)

Multiple edges

b)

Vertices

c)

Loop

d)

Node

3.

No arrows are shown on the edges.

a)

Directed graph

b)

Weighted graph

c)

Simple graph

d)

Undirected graph

4.

An undirected and unweighted graph with no multiple edges.

a)

Undirected graph

b)

Unweighted graph

c)

Incomplete graph

d)

Simple graph

5.

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

a)

adjacent

b)

connected

c)

planar

d)

disconnected

6.

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

a)

Connected graph

b)

Planar graph

c)

Complete graph

d)

Disjoint graph

7.

If a (blank) is removed, it will leave the graph disconnected.

a)

node

b)

region

c)

bridge

d)

loop

8.

An edge (sometimes called an arc) is the link between two _____.

a)

Points

b)

Verticies

c)

Networks

d)

Locations

9.

deg(B) = ?

a)

1

b)

2

c)

3

d)

4

10.

A small section of a network is called a ______?

a)

section

b)

subgraph

c)

partial graph

d)

partial network

11.

A loop has a degree of 2.

a)

True

b)

False

12.

The number of edges will always equal half the number of degrees.

a)

True

b)

False

13.

Identify the number of edges a graph with a sum of degrees = 10 will have.

a)

2

b)

20

c)

5

d)

10

14.

Identify the number of edges a graph with a sum of degrees = 30 will have.

a)

15

b)

17.5

c)

30

d)

60

15.

Identify the number of edges a graph with a sum of degrees = 22 will have.

a)

44

b)

33

c)

12

d)

11

16.

Adjacency matrices represent the number of edges that connect vertices.

a)

True

b)

False

17.

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

a)

0

b)

1

c)

2

d)

3

18.

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

a)

0

b)

1

c)

2

d)

3

19.

A graph that can be drawn in 2D without crossing of edges.

a)

bipartite

b)

connected

c)

complete

d)

planar

20.

If a network can be drawn without taking the pen off the page and without going over the same edge twice it is ...

a)

Eulerian

b)

Hamiltonian

c)

traversable

d)

semi-Hamiltonian

21.

_________ are called edges or arcs

a)

Lines

b)

Vertex

c)

Node

d)

Loop

22.

True or false.


Edges don't always have to be straight lines.

a)

True

b)

False

23.

Identify the type of graph

a)

Simple

b)

Disconnected

c)

Complete

d)

Connected

24.

Identify the type of graph

a)

Simple

b)

Connected

c)

Complete

d)

Disconeccted

25.

Identify the type of graph

a)

Connected

b)

Disconnected

c)

Complete

d)

Simple

26.
The number of vertices in the given graph is:
a)
3
b)
5
c)
6
d)
7
27.
The number of edges in the graph is:
a)
5
b)
6
c)
7
d)
9
28.
The degree of vertex B in the graph is: 
a)
4
b)
3
c)
2
d)
1
29.
The sum of the degrees of the vertices is:
a)
6
b)
17
c)
18
d)
20
30.
Number of Edges in this Network
a)
6
b)
4
c)
5
d)
8
31.
Number of Faces in the Graph
a)
4
b)
3
c)
8
d)
2
32.
Number of Faces in this Graph
a)
5
b)
4
c)
10
d)
8
33.
Determine the degree Sum of the Graph
a)
9
b)
18
c)
12
d)
6
34.
Are these three Graphs Isomorphic (contain the same information)
a)
Yes
b)
No
35.
Are these three Graphs Isomorphic (contain the same information) ?
a)
Yes
b)
No
36.
What is the degree of Vertex C
a)
deg(C) = 2
b)
deg(C) = 1
c)
deg(C)=4
d)
deg (C) = 3
37.

How many faces does this graph have?

a)

3

b)

2

c)

4

d)

5

38.

What is a planar graph?

a)

A complete graph with intersecting edges

b)

When a graph can be drawn with no intersecting edges

c)

When the graph has two intersecting edges

d)

A graph that looks like an aeroplane.

39.

How many faces will there be for a connected planar graph of 7 vertices and 10 edges?

a)

5

b)

3

c)

6

d)

2

40.

What is Euler's formula for planar graphs:

a)

v - e + f =2

b)

v - e - f =2

c)

v + e + f =2

d)

v + e - f =2

41.

For a connected planar graph of 5 vertices and 3 faces, how many edges will there be?

a)

6

b)

4

c)

10

d)

8

42.

How many faces does this planar graph have?

a)

3

b)

4

c)

2

d)

5

43.

Which is false?

a)

This graph is planar

b)

This graph is simple

c)

This graph is complete

d)

This graph is connected

44.
Number of Faces in this Graph
a)
5
b)
4
c)
10
d)
8
45.
Determine the degree sum of the Graph
a)
6
b)
12
c)
8
d)
4
46.

A sequence of vertices for which each vertex in the sequence is joined to the next vertex in the sequence by an edge.

a)

Walk

b)

Closed walk

c)

Path

d)

Trail

47.

A walk that doesn’t finish at the starting vertex.

a)

Walk

b)

Closed walk

c)

Open walk

d)

Trail

48.

A walk that has no repeat use of edges or vertices (except perhaps to end at the starting vertex).

a)

Path

b)

Closed walk

c)

Open walk

d)

Trail

49.

Every path is a trail.

a)

TRUE

b)

FALSE

50.

A walk that has no repeated edges (but can

revisit vertices).

a)

Path

b)

Trail

c)

Eulerian trail

d)

Hamiltonian circuit

51.

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

a)

adjacent

b)

connected

c)

planar

d)

disconnected

52.

Which of the following best describes an Eulerian graph?

a)

Covers every edge once and starts and ends at same vertex.

b)

Includes every vertex exactly once and starts and finishes at same vertex.

c)

Includes every vertex exactly once. Starts and finishes at different vertex.

d)

Covers every edge once and starts and ends at different vertex.

53.

Which of the following best describes a Hamiltonian trail?

a)

Covers every edge once and starts and ends at same vertex.

b)

Includes every vertex exactly once and starts and finishes at same vertex.

c)

Includes every vertex exactly once. Starts and finishes at different vertex.

d)

Covers every edge once and starts and ends at different vertex.

54.

Which is false?

a)

This graph is planar

b)

This graph is simple

c)

This graph is complete

d)

This graph is connected

55.

Path ABCADGAFEA is an example of a _______________

a)

Eulerian trail

b)

Semi-Eulerian trai

c)

Hamiltonian cycle

d)

Semi-Hamiltonian cycle

56.

Path CDECABE is an example of a _______________

a)

Eulerian trail

b)

Semi-Eulerian trai

c)

Hamiltonian cycle

d)

Semi-Hamiltonian cycle

57.

Path ABCEDA is an example of a _______________

a)

Eulerian trail

b)

Semi-Eulerian trai

c)

Hamiltonian cycle

d)

Semi-Hamiltonian cycle

58.

Path ABCDE is an example of a _______________

a)

Eulerian trail

b)

Semi-Eulerian trai

c)

Hamiltonian cycle

d)

Semi-Hamiltonian cycle

Similar Resources on Wayground

Functions!

63 questions

Functions!

quiz

Worksheet

•

9th - 12th Grade

Test: Week 3

61 questions

Test: Week 3

quiz

Worksheet

•

10th - 12th Grade

Algebra Support Cumulative Review

57 questions

Algebra Support Cumulative Review

quiz

Worksheet

•

9th - 12th Grade

Algebra 1: Topic 9 (Solving Quadratic Equations)

53 questions

Algebra 1: Topic 9 (Solving Quadratic Equations)

quiz

Worksheet

•

9th - 12th Grade

Unit 3 Practice - Unit Circle & Trig

54 questions

Unit 3 Practice - Unit Circle & Trig

quiz

Worksheet

•

9th - 12th Grade

Unit 3 Review

62 questions

Unit 3 Review

quiz

Worksheet

•

10th - 12th Grade

Topics 6.1-6.6 Review

63 questions

Topics 6.1-6.6 Review

quiz

Worksheet

•

10th - 12th Grade

Statistics Test Review

53 questions

Statistics Test Review

quiz

Worksheet

•

9th - 12th Grade