题目

英语翻译
画已知阶数所有非同构的无向树,首先可由阶数(顶点数)确定边数,再由握手定理知其顶点的总度数,定出可图化的度数列,从而依次求得各种度数列需按的非同构的无向树.关键词：度数列,握手定理,非同构.

提问时间：2021-03-05

答案

画已知阶数所有非同构的无向树,首先可由阶数(顶点数)确定边数,再由握手定理知其顶点的总度数,定出可图化的度数列,从而依次求得各种度数列需按的非同构的无向树.关键词：度数列,握手定理,非同构.
All paintings are known to order the non-extraordinary to the tree structure,first of all by the order (top points) to determine the number of edges and then shook hands with the total Vertex Theorem know degrees,set to map out of the degrees,which in turn seek out according to various degrees of non-free to the tree structure.Keywords:degrees out,shook hands theorem,unusual conformation.