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.
What is the degree of a vertex in a graph?
The number of edges connected to that vertex.
The total number of vertices in the graph.
The length of the longest path starting from that vertex.
The number of self-loops on that vertex.
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 user's privacy settings.
The number of groups the user belongs to.
The user's influence score.
If every vertex in a graph has an even degree, what can we conclude about the graph?
It must have an Eulerian cycle.
It must be a tree.
It must be bipartite.
It must be directed.
Removing a vertex from a graph also requires you to remove:
All vertices connected to it.
All edges connected to it.
The vertex with the highest degree.
All cycles in the graph.
Which data structure is commonly used to represent the order of visited vertices during a Depth-First Search?
Stack
Queue
Heap
Linked List
Which algorithm is typically used to find the shortest path in a weighted graph where edge weights are non-negative?
Bellman-Ford Algorithm
Depth First Search (DFS)
Breadth First Search (BFS)
Dijkstra's Algorithm
What data structure is typically used to implement the core of a Breadth-First Search (BFS) algorithm?
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 + E)
O(E)
O(V)
Which of the following graph traversal algorithms is generally more suitable for finding the shortest path in an unweighted graph?
Both DFS and BFS are equally suitable.
Depth-First Search (DFS)
Breadth-First Search (BFS)
Neither DFS nor BFS can find shortest paths in unweighted graphs.