All digraphs are n-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible

Abstract

A vertex-deleted subdigraph of a digraph D is called a card of D. A card of D with which the degree triple of the deleted vertex is also given is called a dacard of D. A digraph is called N-reconstructible if it is determined uniquely by its collection of dacards. We prove that some new classes of digraphs are N-reconsructible and show that all digraphs are N-reconstructible if all 2-connected digraphs are N-reconstructble.