In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains
Data(s) |
1987
|
---|---|
Resumo |
The test based on comparison of the characteristic coefficients of the adjancency matrices of the corresponding graphs for detection of isomorphism in kinematic chains has been shown to fail in the case of two pairs of ten-link, simple-jointed chains, one pair corresponding to single-freedom chains and the other pair corresponding to three-freedom chains. An assessment of the merits and demerits of available methods for detection of isomorphism in graphs and kinematic chains is presented, keeping in view the suitability of the methods for use in computerized structural synthesis of kinematic chains. A new test based on the characteristic coefficients of the “degree” matrix of the corresponding graph is proposed for detection of isomorphism in kinematic chains. The new test is found to be successful in the case of a number of examples of graphs where the test based on characteristic coefficients of adjancency matrix fails. It has also been found to be successful in distinguishing the structures of all known simple-jointed kinematic chains in the categories of (a) single-freedom chains with up to 10 links, (b) two-freedom chains with up to 9 links and (c) three-freedom chains with up to 10 links. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/21370/1/163.pdf Mruthyunjaya, TS and Balasubramanian, HR (1987) In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains. In: Mechanism and Machine Theory, 22 (2). pp. 131-139. |
Publicador |
Elsevier Science |
Relação |
http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V46-482GNB8-T8&_user=512776&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_acct=C000025298&_version=1&_urlVersion=0&_userid=512776&md5=7bcfa58cbec15eec91a10fc12e1f0750 http://eprints.iisc.ernet.in/21370/ |
Palavras-Chave | #Mechanical Engineering |
Tipo |
Journal Article PeerReviewed |