【摘要】 在Harary和Palmer的有关有向图的重构的基础上得到:若有向路的顶点数大于4,则可以利用它的一组有向子树重构该有向路.结合Harary和Palmer给出的有向图的重构定理,推出结论:设T是有ν(ν≥4)个顶点的有向树,则T可由其子图{T-vi}完全确定(其中i=1,2,…,ν).更多还原

【Abstract】 Based on F.Harary and E.Palmer’s reconstruction of a tree from its maximal subtrees,this paper gives the method to reconstruct an oriented path which has at least four vertices from its subtrees.A conclusion is drawn that it can be decided by its subtrees {T-vi}(i=1,2,…,ν) if T is an oriented tree with at least four vertices.更多还原