In this paper, the convergence rate and time analysis of a fault-tolerant consensus algorithm that we proposed in [1] is carried out for asynchronous and synchronous partially connected networks with delay on communication paths. The results are also extended to the case of networks with time-varying underlying graph topology.