An algorithm of topological ordering of vertices is proposed for generating a unique edge list of a given graph, and used for the isomorphism test. This also makes it possible to find the sets of similar vertices and edges of the graph. This is applied to the graphs representing kinematic chains.

This content is only available via PDF.
You do not currently have access to this content.