Self Practice 5.1 (c) Chapter 5 Network in Graph Theory Form 4 K

What is a subgraph in graph theory?

• A graph with different vertices and edges

• A graph with the same vertices and edges

• A graph with only edges and no vertices

• A graph with only vertices and no edges

How many vertices are there in the given graph?

• 9

• 10

• 4

• 6

What is the formula to determine if a graph is a tree?

• Number of edges = Number of vertices - 1

• Number of edges = Number of vertices + 1

• Number of edges = Number of vertices

• Number of edges = Number of vertices * 2

In the given graph, how many edges are there connected to vertex P?

• 3

• 2

• 1

• 4

What is the minimum total weight of the tree drawn from the given graph?

• 98

• 110

• 124

• 136

How many subgraphs are drawn in the example?

• 3

• 5

• 7

• 9

What is the weight of the edge connecting vertices Q and R?

• 20

• 18

• 36

• 24

How many edges are connected to vertex U in the given graph?

• 4

• 3

• 2

• 1

Which vertex is connected to vertex T with a weight of 32?

• Q

• R

• S

• P

What is the total number of vertices in the graph?

• 10

• 9

• 6

• 4