443 views
1 votes
1 votes
If d(V) ≥ n/2 for each vertex V in G, then G is hamiltonian. [d(V) is the degree of a vertex V]

True/False explain:

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
iarnav asked May 7, 2017
1,243 views
how to prove that sum of all the vertices in a graph G is equal to twice the number of edges in G.please explain step by step .
1 votes
1 votes
0 answers
3
0 votes
0 votes
0 answers
4
Debargha Mitra Roy asked Jan 10
40 views
$Given \ A=\begin{bmatrix} 1&20&0 \\ -1&7&1 \\ 3&0&-2 \end{bmatrix},\ find\ tan\ A\ .$