In this paper we show by counter example that one of the main results in the paper "Edge Geodetic Covers in Graphsby Mariano and Canoy (International Mathematical Forum, 4, 2009, no. 46, 2301 - 2310) does not hold. Further, we partially characterize connected graphs G of order n for which its edge geodetic number ge(G) = n — 1.