Isomorphism identification of graphs: Especially for the graphs of kinematic chains
β Scribed by Huafeng Ding; Zhen Huang
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 854 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0094-114X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract This paper considers conditions ensuring that cycleβisomorphic graphs are isomorphic. Graphs of connectivity β©Ύ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycleβisomorphic to __G__ is also isomor
This paper presents a systematic approach, which is based on a new graph representation of geared kinematic chains, for the structural synthesis of geared kinematic chains. First, the new graph representation of geared kinematic chains is introduced. Next, a simple method is proposed to generate all
We prove that if two Cayley graphs of Z~ are isomorphic, then they are isomorphic by a group automorphism of Z 3. In [3], Babai and Frankl conjectured that Z 3 is a CI-group with respect to graphs for all primes p and k >t 1. The case k = 1 was settled positively by several authors [1,3,5,6]. It wa