1 votes
1
0 votes
2
The state of a process during context switching is 1. May be busy2. May be idle3. Always idle4. always busy
1 votes
4
Prove that in finite graph, the number of vertices of odd degree is always even.
7 votes
9
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$