A closed formula is derived for walk counts of negative order k in a graph or molecule, as defined recently by Lukovits and Trinajstić. Some unexpected observations made by these authors easily follow from this formula. Gratifyingly, the formula is very similar to the one obtained earlier for usual walk counts. Moreover, while for walk counts of k → +∞ the numerically largest eigenvalue of the adjacency matrix plays an important part, for walk counts of k → -∞ the numerically smallest eigenvalue plays a corresponding part.