The Chung-Yau graph invariants were originated from Chung-Yau's work on discrete Green's function. We show how they could be used to derive new explicit formulas and estimates for hitting times of random walks. We also apply them to study graphs with symmetric hitting times.