This paper reduced Qiu s criterion to a simpler version in terms of weighted graphs.
本文用加权图的语言给出了这个充要条件一个简单的组合论的刻画。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
In this paper, we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
本文我们利用带权核子图的可重构性证明了连通图是可重构的，从而证明了重构猜想为真。
In this paper, we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
本文我们利用带权核子图的可重构性证明了连通图是可重构的，从而证明了重构猜想为真。
应用推荐