Trees, Directed Graphs and Weighted Graphs

Which of the following is NOT a directed graph? (choose 1 out of the 4)

• 
• 
• 
• 

If a tree has n nodes, how many edges does it have?

• n - 1 edges

• n + 1 edges

• n edges

• n - 2 edges

How many edges are needed to connect 8 vertices in a connected graph?

• 6

• 7

• 9

• 10

Which statements are true for trees in graph theory? (Choose 1)

• They are free from any cycles

• They are not connected to each other

• They are complete

• They contain cycles

If you travel along 9 edges in a tree, how many vertices do you visit?

• 8

• 9

• 10

• 7

What do roads in a directed graph resemble?

• Two-way streets

• One-way streets

Does the cycle EFGEHFE exist in this directed graph?

• Yes

• No

Which of the following sequences is not a valid path in the given directed graph?

• 4312

• 0123054

• 54321

• 31230

What do these graphs have in common?

• Directed graphs

• Weighted Graphs

• Tree Graphs

• Simple Graphs

Why is the given graph not a tree?

• Because not all vertices have odd degrees

• Because it contains a cycle, which is not allowed in a tree

• Because not all vertices have even degrees

• Because it does not contain a cycle, which is required for a tree