On 3-skein isomorphisms of graphs
โ Scribed by H. A. Jung; A. K. Kelmans; R. L. Hemminger
- Book ID
- 110564472
- Publisher
- Springer-Verlag
- Year
- 1982
- Tongue
- English
- Weight
- 203 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
For graphs G and G' with minimum degree at least 3 and satisfying one of three other conditions, w e prove that any isomorphism from the &graph P3(G) onto P3(G') can be induced by a (vertex-) isomorphism of G onto G'. This in some sense can be viewed as a counterpart with respect to P3-graphs for Wh
The P 3 -graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected finite simple graphs G and H with isomorphic P 3 -graphs are either isom
Let G be a finite group and Cay(G,S) the Cayley graph of G with respect to S. A subset S is called a CI-subset if, for any TCG, Cay(G,S) ~ Cay(G,T) implies S ~ = T for some ct E Aut(G). In this paper, we investigate the finite groups G in which every subset S with size at most m and (S) = G is a CI-