Chapter 5 Network in Graph Theory

A simple graph has no loops. What other property must a simple graph have?

• It must be directed.

• It must be undirected.

• It must have at least one vertex.

• It must have no multiple edges.

Determine a simple graph.

• 
• 
• 
• All the graphs are simple graphs.

Which graph is a simple graph but not complete graph?

• 
• 
• 
• 

Which one is NOT a subgraph of the above graph?

• 
• 
• 
• 

The directed graph on the right shows the

roads connecting Lani’s house at A to the

school at E. Suggest the shortest route

that Lani can choose to cycle to school.

• A > C > D > E

• A > B > C > E

• A > D > E

• A > B > E

Determine the number of vertices and sum of degrees.

• 8,16

• 8,8

• 6,4

• 8,13

Determine the sum of degrees.

• 4

• 8

• 16

• 32

Determine n(E).

• 7

• 12

• 14

• 6

Determine n(V).

• 4

• 8

• 5

• 10

No arrows are shown on the edges.

• Directed graph

• Weighted graph

• Simple graph

• Undirected graph