In a social network represented as a graph, what does the degree of a vertex signify?
The number of friends or connections a user has.
The number of groups the user belongs to.
The user's privacy settings.
The user's influence score.
Which of the following graph algorithms is best suited for finding the shortest path in a weighted graph?
Depth-First Search
Topological Sort
Dijkstra's Algorithm
Breadth-First Search
In an undirected graph with 5 vertices, what is the maximum number of edges you can add without creating a cycle?
10
5
6
4
You remove an edge from a connected graph. What is a possible consequence of this action?
The graph will always become disconnected.
The graph may become disconnected.
The number of edges and vertices in the graph will decrease.
The number of cycles in the graph will always decrease.
In an undirected graph, if the sum of the degrees of all vertices is 30, how many edges are there in the graph?
Cannot be determined.
15
60
30
Adding an edge between two vertices in an undirected graph always:
Creates a cycle.
May increase or decrease the number of connected components.
Decreases the number of connected components.
Increases the number of connected components.
What is the time complexity of performing a Breadth-First Search on a graph with 'V' vertices and 'E' edges?
O(V + E)
O(V)
O(E)
O(V * E)
Which of the following graph representations is most efficient for checking if two vertices are adjacent?
Adjacency List
Adjacency Matrix
Edge List
Incidence Matrix
What is a cycle in a graph?
The longest path between any two vertices.
A graph that is not connected.
A path that starts and ends at the same vertex.
A vertex with a degree of 1.
Which of the following graph traversal algorithms is generally more suitable for finding the shortest path in an unweighted graph?
Breadth-First Search (BFS)
Both DFS and BFS are equally suitable.
Neither DFS nor BFS can find shortest paths in unweighted graphs.
Depth-First Search (DFS)