Representation of planar kinematic chains with multiple joints based on a modified graph and isomorphism identification

Kaijie Dong, Duanling Li*, Xianwen Kong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
40 Downloads (Pure)


The representation and isomorphism identification of kinematic chains (KCs) with multiple joints are crucial issues to be solved in mechanism research. In this paper, a modified graph—planar face graph (PF graph), is proposed. As a key concept, “face” has been put forward to represent the case that a single, specific relationship is incident with multiple incidents. Some other basic concepts relating to PF graph are also explained in detail. PF graph is used to represent KCs with multiple joints and it reflects the uniqueness of KCs and realizes the one-to-one correspondence between KCs and adjacency and incident matrices. It also establishes relationships with other methods for representing KCs and it is proved to be suitable for complex mechanical systems. Moreover, the sufficient and necessary condition of isomorphism are derived, and two properties of permutation similarity are analysed. Based on them, the modified eigenvalue eigenvector method and the maximum path method are proposed, and they are integrated to form a new algorithm. In addition, the reliability and efficiency of the algorithm are proved.

Original languageEnglish
Article number104793
JournalMechanism and Machine Theory
Early online date28 Feb 2022
Publication statusPublished - Jun 2022


  • Eigenvalue eigenvector method
  • Isomorphism identification
  • Kinematic chains
  • Multiple joints
  • Permutation similarity

ASJC Scopus subject areas

  • Bioengineering
  • Mechanics of Materials
  • Mechanical Engineering
  • Computer Science Applications


Dive into the research topics of 'Representation of planar kinematic chains with multiple joints based on a modified graph and isomorphism identification'. Together they form a unique fingerprint.

Cite this