卷別

基礎數學

選擇

國立中興大學 2025 · 考試 · 第 21 題

(2 points) Which of the following descriptions of trees is false?

(A)
A tree is a connected directed graph with no simple circuits.
(B)
A rooted tree is a tree in which one vertex has been designated as the root and every edge is directed away from the root.
(C)
A rooted tree is called an $m$ -ary tree if every internal vertex has no more than $m$ children.
(D)
A tree with $n$ vertices has $n-1$ edges.
(E)
A full $m$ -ary tree with $i$ internal vertices contains $n = mi + 1$ vertices.

標準解析

AI 已複查