Regular sub-graph of Complete Graph

摘要

For the complete graph k_(2m+2) for m≥2; we study Hamiltonian circuits and edge disjoint Hamiltonian circuits of various type of regular sub-graph of the complete graph K_(2m+2). We have been studied the perfect matching of these types of regular sub-graph of various degrees. Finally, we have established an algorithm to solve the traveling salesman problem when the weights of the edges are non-repeated of the complete graph K_(2m+2) for m≥2 for symmetrical problems.