The proof of isomorphic graphs is done with the definition,which is complicated and irregular.

Base on this approach, the similarity of process plan instances of different parts can be evaluated by the subgraph isomorphism method, after that, a filter function is performed to scale down the instance set, then the user can select instance from it to start his process plan design.

This vertex refinement method can be used in graph isomorphism algorithms to reduce the number of mapping between the vertexes.

For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.

Similarity acquisition of function-structure feature template for configurable products based on subgraph isomorphism

The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex.

A new approach to local matching of CAD models based on subgraph isomorphism is presented.

By applying permutation group theory,the concepts of hyperedge group, hypergraph group and hypergraph isomorphism are introduced, and the general expressions of hyperedge group and its cycle index are derived.

The recognition method of circuit drawing plotted by AutoCAD is proposed It uses the topological graph to describe the electrical symbol s drawing and adopts the isomorphic graph algorithm to recognize the electrical symbols, meanwhile,the circuit wires are also recognized It can recognize the circuit drawing automatically with high accurac