68 views
Which of the following is $\textbf{not}$ TRUE?

(a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd.
(b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and  n $\geq$2), Euler circuit exists $\Leftrightarrow$ m and n are even.
(C) In a cycle graph $C_n$($n \geq$3), Euler circuit exits for all $n$

(d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.
| 68 views

Option d

If degree of all vertex is even then euler ckt is exist.

• In complete graph (kn) . If n is odd then degree of vertex  become even . So it is always eular ckt for odd number of n.

by Boss (35.3k points)
selected by
0
Thanks.
I think (d) is correct as if n is even then the degree of the universal vertex will be (n-1) which implies no euler's circuit.
by (11 points)