Ramachandran S. and Monikandan S., “All digraphs are n-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible”, A Canadian journal of applied mathematics, computer science and statistics, vol. 71, Sep. 2006.