## In an Adjacency Matrix Which Encodes for a Directed Hamiltonian Path, a Non-Zero Determinant Value Certifies the Existence of a Directed Hamiltonian Path When no Zero Rows (Columns) and no Similar Rows (Columns) Exist in the Adjacency Matrix

**Authors:** Okunoye Babatunde O.

The decision version of Directed Hamiltonian path problem is an NP-complete problem which asks, given a directed graph G, does G contain a directed Hamiltonian path? In two separate papers, the author expresses the graph problem as an adjacency matrix and a proof given to show that under two special conditions relating to theorems on the determinant of a square matrix, a non-zero determinant value certifies the existence of a directed Hamiltonian path. Here, a brief note is added to repair a flaw in the proof. The result, as expressed in the paper title is a more defensible proposition

**Comments:** 6 Pages.

**Download:** **PDF**

### Submission history

[v1] 2012-10-10 05:51:51

**Unique-IP document downloads:** 456 times

**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.*

*
*