What are the in-degree and out-degree of vertex 4? 
In graph theory: - The in-degree of a vertex is the number of incoming edges to that vertex.
- The out-degree of a vertex is the number of outgoing edges from that vertex.
Looking at the graph:
- Vertex 4 has 3 incoming edges (from vertices 1, 2, and 3).
- Vertex 4 has 2 outgoing edges (to vertices 1 and 3).
Thus, the in-degree of vertex 4 is 3, and the out-degree of vertex 4 is 2.
The correct answer is \( 3 \text{ and 2} \).
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.

It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?
Match LIST-I with LIST-II

Choose the correct answer from the options given below:
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below: