摘要
利用0.1正交矩阵、邻接矩阵讨论了树的自同构交换,给出了树为优美树的充要条件;并对完全图的邻接矩阵进行了讨论,也给出了树为优美树的充要条件。这些充要条件为判定树的优美性及求优美标号提供了算法。
In this paper we discuss automorphism of trees by using 0.1 orthogonal matrix and djacency matrix, giving the sufficient and necessary condition on that a tree is pleasant. We discuss adjacency matrix of completc graph, and also give another sufficient and necessary condition on that a tree is pleasant. These conditions provide the algorithm for obtaining pleasant marks as well as judging pleasant trees.
关键词
优美树
邻接矩阵
正交矩阵
pleasant tree
adjacency matrix
orthogonal matrix
level matrix
