  The vertex-edge incidence matrix of a (connected) unicyclic graph G is a
square matrix which is invertible if and only if the cycle of G is an odd
cycle. A combinatorial formula of the inverse of the incidence matrix of an odd
unicyclic graph was known. A combinatorial formula of the Moore-Penrose inverse
of the incidence matrix of an even unicyclic graph is presented solving an open
problem.
