Answers are grounded in this paper and cite their sources.
This paper proposes a new method for detection of graph isomorphism using the concept of quadratic form. Graphs/kinematic chains are represented first by quadratic form, and the comparison of two graphs is thus reduced to the comparison of two quadratic form expressions. If both the lengths and the directions of the semiaxes of quadric surfaces, which are characterized by the eigenvalues and eigenvectors, are the same, the associated graphs/kinematic chains are isomorphic. An algorithm is developed based on this idea, and tested for the counter-examples known to other methods.
No takes yet. Share an insight, caveat, or question.
and et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: