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 U = {1, 2, 3}. Let 2U denote the powerset of U. Consider an undirected graph G whose vertex set is 2U. For any A, B ∈ 2U, (A, B) is an edge in G if and only...
Let U = {1, 2, 3}. Let 2U denote the powerset of U. Consider an undirected graph G whose vertex set is 2U. For any A, B ∈ 2U, (A, B) is an edge in G if and only...
Let U = {1, 2, 3}. Let 2U denote the powerset of U. Consider an undirected graph G whose vertex set is 2U. For any A, B ∈ 2U, (A, B) is an edge in G if and only...
Total Unique Visitors
Loading......