Computer Sciences > GATE 2023 > Graph Theory
Let G be a simple, finite, undirected graph with vertex set {v1,...,vn}. Let Δ(G) denote the maximum degree of G and let N = {1, 2,...} denote the set of all possible colors. Color the vertices of G using the following greedy strategy: for i = 1,...,n
color(vi) <- min{j ∈ N: no neighbour of vi is colored j}
Which of the following statements is/are TRUE?
color(vi) <- min{j ∈ N: no neighbour of vi is colored j}
Which of the following statements is/are TRUE?
Correct : a,b
Similar Questions
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represen...
Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected co...
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, a...
Total Unique Visitors
Loading......