Hamiltonian completions of sparse random graphs Original Research Article

Given a (directed or undirected) graph G, finding the smallest number of additional edges which make the graph Hamiltonian is called the Hamiltonian Completion Problem (HCP). We consider this problem in the context of sparse random graphs image on n nodes, where each edge is selected independently with probability image. We give a complete asymptotic answer to this problem when image, by constructing a new linear time algorithm for solving HCP on trees and by using generating function method. We solve the problem both in the cases of undirected and directed graphs.