How to prove this?

Правка en1, от anand.19je0125, 2022-03-15 13:42:10

G is Hamilton-connected if every two vertices of a graph are connected by a Hamiltonian path. Show that if G is Hamilton-connected and v >=4, then e >= 1/2*[(3v+ 1)] where v is the no. of vertices and e is the no. of edges

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский anand.19je0125 2022-03-15 13:42:10 243 Initial revision (published)