Edges in a six-vertex tree
Apply the tree condition—connected and acyclic—to a concrete six-station network.
The video could not load. Check your connection and try again, or download it directly.
Download video
Open Chinese transcript
- 路线图有六个站,要求连通而且没有环。这样的图叫树,我们从一个站开始逐个接入。
- 第一个站不需要边。每添一个新站,为了连通至少要接一条边。
- 如果新站同时连接两个旧站,就会在已有连通路线中形成环,所以树里每次只能添一条。
- 从一个站添到六个站,一共添了五次,也就得到五条边。
- 这六个站由五条边连在一起;删掉任意一条边都会断开,说明没有多余的成环边。
- 请在现有六站树旁添一个新站,只画一条连接线让它仍然连通且无环。小宝贝到你了。
Sources for this explanation
Logical thinking
Use the theorem that a finite tree with v vertices has v−1 edges, and verify the concrete graph.
Worked example
How many links does a connected, acyclic network of 6 stations have?
A connected acyclic graph is a tree. With 6 vertices it has 6−1=5 edges.
Try one question
A tree with 8 vertices has 7 edges.