Networks Concepts Introductions

• 3

• 5

• 6

• 7

• 9

True or False?

These graphs are of the same network.

• True

• False

An edge that connects a vertex to itself is called:

• 2

• 3

• 4

• 5

• 6

True or False?

This graph is traversable.

• True

• False

• Vertices: 12

  Edges: 12

• Vertices: 12

  Edges: 24

• Vertices: 24

  Edges: 24

• Vertices: 24

  Edges: 48

• 4

• 6

• 8

• 12

A walk on the graph given by G-H-S-F-C-P-F-G is best described as:

• G-P-C-F-P-G

• F-G-P-G-H-F

• S-C-P-F-C-S

• P-F-H-G-F-P

• C-F-H-G-P-C

• 
• 
• 
• 
•