contributor author | Frank Harary | |
contributor author | Hong-Sen Yan | |
date accessioned | 2017-05-08T23:33:18Z | |
date available | 2017-05-08T23:33:18Z | |
date copyright | March, 1990 | |
date issued | 1990 | |
identifier issn | 1050-0472 | |
identifier other | JMDEDB-27579#79_1.pdf | |
identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/107288 | |
description abstract | In terms of concepts from the theory of graphs and hypergraphs we formulate a precise structural characterization of a kinematic chain. To do this, we require the operations of line graph, intersection graph, and hypergraph duality. Using these we develop simple algorithms for constructing the unique graph G (KC) of a kinematic chain KC and (given an admissible graph G) for forming the unique kinematic chain whose graph is G. This one-to-one correspondence between kinematic chains and a class of graphs enables the mathematical and logical power, precision, concepts, and theorems of graph theory to be applied to gain new insights into the structure of kinematic chains. | |
publisher | The American Society of Mechanical Engineers (ASME) | |
title | Logical Foundations of Kinematic Chains: Graphs, Line Graphs, and Hypergraphs | |
type | Journal Paper | |
journal volume | 112 | |
journal issue | 1 | |
journal title | Journal of Mechanical Design | |
identifier doi | 10.1115/1.2912583 | |
journal fristpage | 79 | |
journal lastpage | 83 | |
identifier eissn | 1528-9001 | |
keywords | Chain | |
keywords | Accuracy | |
keywords | Theorems (Mathematics) | |
keywords | Intersections AND Algorithms | |
tree | Journal of Mechanical Design:;1990:;volume( 112 ):;issue: 001 | |
contenttype | Fulltext | |