  We introduce a non-backtracking Laplace operator for graphs and we
investigate its spectral properties. With the use of both theoretical and
computational techniques, we show that the spectrum of this operator captures
several structural properties of the graph in a more precise way than the
classical operators that have been studied so far in the literature, including
the non-backtracking matrix.
