On n-skein isomorphisms of graphs
โ Scribed by R.L Hemminger; H.A Jung
- Book ID
- 107884150
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 529 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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-
A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) โผ = Cay(G, T ), there exists an automorphism ฯ of G such that S ฯ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a
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