In this paper we use the \textit{concurrence vector}, as a measure of
entanglement, and investigate lower and upper bounds on the concurrence of a
superposition of bipartite states as a function of the concurrence of the
superposed states. We show that the amount of entanglement quantified by the
concurrence vector is exactly the same as that quantified by
\textit{I-concurrence}, so that our results can be compared to those given in
[Phys. Rev. A {\bf 76}, 042328 (2007)]. We obtain a tighter lower bound in the
case that two superposed states are orthogonal. We also show that when the two
superposed states are not necessarily orthogonal, both lower and bounds are, in
general, tighter than the bounds given in terms of the I-concurrence. An
extension of the results to the case with more than two states in the
superpositions is also given.Comment: 1 figure, 8 page