Abstract
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 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
