1Patidarrang College, Muktapur, P.O. Loch, Kamrup, Assam, India.
2Department of computer application, Assam Engineering College, Guwahati-13, Assam, India.
3Department of Statistics, Gauhati University, Guwahati-14, Assam, India.
In this paper, various properties of some planar regular sub graphs of various degrees of the complete graph K2m+2 for m≥2 have been discussed. An algorithm has been developed to find out the least cost route (minimum weighted Hamiltonian circuit) of traveling salesman problem with the help of these sub-graphs.
