Criterion Of Isomorphism For Trees And The Application Of Tree In Concept Lattice And Inverse Matrix

The notation of tree is used for object and tool in graph theory, using this notation, this paper firstly researches the problem of isomorphism between trees, and followed by applying special frame and character that there is just one trail during any two vertices in concept lattice and inverse matrix.The paper will be carried out by three parts. The first part of the paper presents criterion of isomorphism for trees by discussing the simple graph, namely skeleton of tree. Afterwards, we stride an exploring step in order to solve the problem of graph isomorphism.The second part uses tree structure to index the set of concepts in concept lattice, and develops attribute-priority incremental formation algorithm. It greatly reduces the search space of parents and children of new born concept node, Then it can speed up the process of incremental updating of concept lattice.The last part presents a graph method to solve the inverse matrix of a class of invertible matrix with special skeleton that there is just one trail during any two vertices of tree.