Network in Graph Theory

A ____________ is a type of graph that contains at least a pair of connected vertices.

• Tree

• Loop

• Network

• Connected graph

Which of the following is not true about a graph?

• Graph is made up of a set of vertices

• Vertices are connected by edges

• A graph contains a minimum of one vertex and one edge

• Degree is the number of edges connected to two vertices

Which of the following is true about a simple graph?

I Is an undirected graph

II Is a weighted graph

III Without loop

IV Without multiple edges

• I and II

• I and III

• II and IV

• III and IV

Which of the following situations can be modelled as a weighted graph?

• Flight time from one location to the others

• The traffic flow at a junction

• The distance between tourist attractions in a city

• All of the above

In a graph modelling social relationship, a person is represented as ______________ while friendship is represented as ______________.

• vertex, edge

• edge, vertex

• vertex, dot

• circle, entity

Which of the following is the shortest route from A to F?

• A, B, C, D, F

• A, B, C, E, F

• A, B, E, D, F

• A, B, E, F

Based on the diagram , which of the following is the correct network from A to E?

• A, C, D, E

• A, D, C, E

• A, B, C, D

• A, C, B, E

Diagram 1 shows a graph. Calculate the sum of degree.

• 9

• 12

• 18

• 20

Diagram 2 shows a graph.

Which type of graph is represented by the graph?

• Unweighted directed graph

• Unweighted undirected graph

• Weighted directed graph

• Weighted undirected graph

Find the most optimum path to travel from a to d.

• a --> b --> d

• a --> b --> c --> d

• a --> e --> d
  

• a --> d