Discrete Morse theory on graphs

We characterize the topology of a graph in terms of the critical elements of a discrete Morse function defined on it. Besides, we study the structure and some properties of the gradient vector field induced by a discrete Morse function defined on a graph. Finally, we get results on the number of non-homologically equivalent excellent discrete Morse functions defined on some kind of graphs.