Combinatorics and Graph Theory

    

Action Adjointe Sur Les Graphes et la Preuve de la Conjecture P=NP

Authors: Mohamed Sghiar

I study the link between the adjoint action and the Hamiltonian cycles in a symmetric graph. Then by a simple algebraic resolution of a system of equations with several variables I find all the Hamiltonian cycles of the graph. Finally I will apply the results found to give an algorithm of order $ \mathcal{ O } (n ^ 3 ) $ allowing to quickly give all the Hamiltonian cycles with their distance. This gives a proof of the conjecture $ P = NP $.

Comments: 10 Pages. Submited, Frensh version

Download: PDF

Submission history

[v1] 2020-05-06 09:07:23

Unique-IP document downloads: 278 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus