Abstract
In this work, we have made some modifications on the definition of the incidence matrices of a directed graph, to let the incidence matrices to be more confident for X – Labeled graphs. The new incidence matrices are called the incidence matrices of X – Labeled graphs, and we used the new definition to give a computer program for Nickolas`s Algorithm .