In terms of graph theory, the following statement is incorrect ( ).
选项:Nodes in a tree may not be connected to each other.

If there is one more edge in the tree, there must be a circle.

If an edge is removed from a tree, the tree won’t be connected.

If a tree has n nodes, the number of its edges is n-1.

温馨提示支付 ¥0.10 元后可查看付费内容,请先翻页预览!
点赞(0) dxwkbang
返回
顶部