Graph Factorization and its Application Choudhury Jayanta Kr.*, Dutta Anupam**, Kalita Bichitra*** *Swadeshi Academy Junior College, Guwahati-781005 **Patidarrang College, Muktapur, Loch, Kamrup, Assam ***Department of Computer Application, Assam Engg. College, Guwahati-781013 Online published on 26 June, 2013. Abstract In this paper, different types of factorization of graphs of the complete graphs K6m-2, K6m+2 and K6m for m≥1 have been studied. An algorithm for the solution of TSP has been developed. Some theoretical investigations related to 3-factors, 2-factors and 1-factors have been discussed. Finally, some experimental results have been cited. Top Keywords Traveling salesman problem (TSP), Factors of graph, Hamiltonian Circuit. Top |