Parallel mechanism character arrays of topology graphs isomorphism identification and creation automatically

Abstract

How to depict topology graphs and how to identify isomorphic topology graph is the key in parallel mechanisms type synthesis by using topology graphs. In method of systematic linkage and topology matrix-graph approach for parallel mechanism type synthesis, the character of topology graphs are depicted by character arrays. So the isomorphism identification of topology graphs equate with that of character arrays. Based on this analyse deep the inherent rules of character arrays and then define isomorphic character arrays in virtue of the concept of character string. Then put forward the new approach to identify isomorphism of character arrays by virtue of identification matrix. Study how to find all character arrays that are exhaustive and non-isomorphic. Accordingly creating automatically of character arrays can bring into effect. Moreover program about these process with Visual Basic. (5 pages)