Edge$-$node Incidence Matrix

Now, we consider directed graphs and define them according to their adjacency matrices. The edge$-$node incidence matrix $$

of the directed graph $$

is a $\backslash$times $$

matrix such that:

$,=110$if edge $$ leaves node $$if edge $$ enters node $$otherwise

where $$

is the number of edges and $$

is the number of nodes. Note that establishes an ordering on the edges.

Consider the adjacency matrix below: