In a directed graph, if vertex A has an outgoing edge to vertex B, then:
Vertex A is adjacent to vertex B.
Vertex A and B have the same degree.
Vertex B is adjacent to vertex A.
There must be an edge from vertex B to vertex A.
A graph where edges have a direction associated with them is called a:
Undirected Graph
Cyclic Graph
Directed Graph
Weighted Graph
Which data structure is most efficient for checking if an edge exists between two vertices in a sparse graph?
Adjacency List
Linked List
Queue
Adjacency Matrix
Removing a vertex from a graph also requires you to remove:
All cycles in the graph.
All edges connected to it.
All vertices connected to it.
The vertex with the highest degree.
What is the time complexity of performing a Breadth-First Search on a graph with 'V' vertices and 'E' edges?
O(E)
O(V * E)
O(V)
O(V + E)
A graph is said to be __________ if there is a path from any vertex to any other vertex.
Bipartite
Connected
Complete
Disconnected
Which graph traversal algorithm uses a queue to visit vertices?
Bellman-Ford Algorithm
Depth First Search (DFS)
Dijkstra's Algorithm
Breadth First Search (BFS)
Which of the following is an advantage of using an adjacency matrix representation for a graph?
Constant time edge existence check.
Efficient for sparse graphs.
Less memory usage for large graphs.
Faster to find all neighbors of a vertex.
In a social network represented as a graph, what does the degree of a vertex signify?
The number of groups the user belongs to.
The user's influence score.
The user's privacy settings.
The number of friends or connections a user has.
Adding an edge between two vertices in an undirected graph always:
Decreases the number of connected components.
May increase or decrease the number of connected components.
Creates a cycle.
Increases the number of connected components.