  We characterize unicyclic graphs that are singular using the support of the
null space of their pendant trees. From this, we obtain closed formulas for the
independence and matching numbers of a unicyclic graph, based on the support of
its subtrees. These formulas allows one to compute independence and matching
numbers of unicyclic graphs using linear algebra methods.
