We compute the absorbing number of the edge ideals of special graphs such as complete graphs, path graphs, and cycle graphs. We also compute the absorbing number for other monomial ideals. In special cases, we show that the length of a prime filtration of a monomial ideal I is an upper bound for its absorbing number
