332 views
0 votes
0 votes
what are the conditions to check if a graph is hamiltonian ?

1 Answer

0 votes
0 votes
  1. To check a graph is hamiltonian or not check whether a HAMILTONIAN CIRCUIT is present in that graph or not.
  2.  it is satisfying DIRAC's theorem then also you can say.
  3. if it is satisfying ORE's therm theorem then also you can say
  4. but always keep in mind 2nd and 3rd point are only sufficient not necessary condition IF IT IS NOT SATISFYING MEANS YOU CAN NOT SAY IT IS NOT HAMILTONIAN GRAPH.

Related questions

0 votes
0 votes
1 answer
1
gmrishikumar asked Nov 30, 2018
874 views
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
3 votes
3 votes
0 answers
2
thepeeyoosh asked Dec 29, 2017
451 views
How many number of Hamiltonian cycles possible for a complete graph in all the case (i.e. ordered, unordered, edge-disjoint ...)??
0 votes
0 votes
1 answer
3
Neal Caffery asked Dec 11, 2016
399 views
Number of distinct Hamiltonian cycles are there in a unlabeled complete graph K6______ [Note : the path a->b->c is same as b->c->a]
2 votes
2 votes
1 answer
4
VS asked Jan 16, 2018
1,253 views
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)