Maximal Triangle Free Graph and Travelling Salesman Problem
Jayanta KrChoudhury, Bichitra Kalita · International Journal of Computer Applications · 2014
In this paper, a maximal triangle free graph has been generated from the complete graph for by deleting number of edges.In addition, two theorems have been established for it.Finally, an algorithm has been developed under different cases to solve the traveling salesman problem when the weights of the edges are non-repeated of the complete graph for .