acceptable if they are not as widely known as they deserve.
On the connectivity of cayley graphs
โ Scribed by Wilfried Imrich
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 282 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A Cayley graph or digraph Cay(G, S) of a finite group G is called a CI-graph of G if, for any T/G, Cay(G, S)$Cay(G, T) if and only if S \_ =T for some \_ # Aut(G). We study the problem of determining which Cayley graphs and digraphs for a given group are CI-graphs. A finite group G is called a conne
It is proven that every connected Cayley graph X , of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite.
We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group with a certain kind of presentation, then (G; k, 1) โค 2(k +n-1). F
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