  In [1] the problem of finding a sharp lower bound on lower against number of
a general graph is mentioned as an open question. We solve the problem by
establishing a tight lower bound on lower against number of a general graph in
terms of order and maximum degree.
