“tree”的概念、定义、习题解题方法及翻译-数学辞典

单词

tree

释义

tree

A connected graph with no cycles. A disconnected graph with no cycles is called a forest. It can be shown that a connected simple graph with n vertices is a tree if and only if it has n − 1 edges. The figure shows all the trees with up to five vertices (see Cayley's Theorem).

Trees with five vertices or fewer

Particularly in applications, one of the vertices of a tree may be designated as the root, and the tree may be drawn with the vertices at different levels indicating their distance from the root. A rooted tree in which every vertex (except the root, of degree 2) has degree either 1 or 3, as shown below, is called a binary tree.

A rooted, binary tree

随便看

数学辞典收录了4151条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。