Register

UGC NET CSE | December 2018 | Part 2 | Question: 28

• edited by
1,299 views
0 votes
0 votes

In K-coloring of an undirected graph $G=(V,E)$ is a function. $c: V \rightarrow \{0,1, \dots , K-1 \}$ such that $c(u) \neq c(v)$ for every edge $(u,v) \in E$.

Which of the following is not correct?

  1. $G$ is bipartite
  2. $G$ is $2$-colorable
  3. $G$ has cycles of odd length
  4. $G$ has no cycles of odd length
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
3
Arjun asked Jan 2, 2019
967 views
UGC NET CSE | December 2018 | Part 2 | Question: 9
Use Dual Simplex Method to solve the following problem: $\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ & x_2 +x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}$ ... $x_1=0, x_2=2, \text{ and } z=-6$ $x_1=6, x_2=2, \text{ and } z=-18$
Use Dual Simplex Method to solve the following problem:$\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ ...
User Avatar
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,383 views
UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$
User Avatar
Link Copied!