Combinatorics and Graph Theory


Matrix Determinant as a Verifier of a Path (Cycle) in the Directed Hamiltonian Cycle Problem Under Two Special Conditions: a Formal Proof

Authors: Okunoye Babatunde

In earlier work, the author conjectured that under two special conditions relating to theorems on the determinant of a matrix: the absence of a zero row (column) and the absence of similar rows (columns), a non-zero determinant value certifies the existence of a Directed Hamiltonian Path in an arbitrary adjacency matrix. Here, a formal proof is provided by means of deductive logic to establish that in an arbitrary adjacency matrix of size n (n rows and n columns), a non-zero determinant value verifies the existence of a Directed Hamiltonian Path in the adjacency matrix

Comments: 4 Pages. Accepted and Revised at IEEE African Journal of Computing and ICTs

Download: PDF

Submission history

[v1] 2012-09-06 18:40:36
[v2] 2012-09-11 22:39:16

Unique-IP document downloads: 349 times

Articles available on are pre-prints that may not yet have been verified by peer-review and should therefore be treated as preliminary and speculative. Nothing stated should be treated as sound unless confirmed and endorsed by a concensus of independent qualified experts. In particular anything that appears to include financial or legal information or proposed medical treatments should not be taken as such. 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