Isomorphism and Cayley graphs on abelian groups Page 1 Isomorphism and Cayley graphs
on abelian groups Brian ALSPACH* Department of Mathematics and Statistics Burnaby, BC …

A circulant (di) graph is a (di) graph on n vertices that admits a cyclic automorphism of order
n. This paper provides a survey of the work that has been done on finding the automorphism …

It has long been known that a vertex-transitive graph $\Gamma $ is isomorphic to a double
coset graph $\text {Cos}(G, H, S) $ of a transitive group $ G\le\text {Aut}(\Gamma) $, a vertex …

An important part of computer science is focused on the links that can be established
between group theory and graph theory and graphs. Cayley graphs, that establish such a …

The contemporary viva in higher education has a long history. This chapter considers this
history by exploring the viva's form, beginning with the time of the Classical Greeks …

A necessary and sufficient condition is given for two Cayley digraphs X1= Cay (G1, S1) and
X2= Cay (G2, S2) to be isomorphic, where the groups Gi are nonisomorphic abelian 2 …

A Frobenius group is a transitive but not regular permutation group such that only the identity
element can fix two points. A finite Frobenius group can be expressed as G= K⋊ H with K a …

A number of authors have studied the question of when a graph can be represented as a
Cayley graph on more than one nonisomorphic group. The work to date has focussed on a …

We consider the problem of caching multimedia streams in the internet. We use the dynamic
caching framework of Dan et al. and Hofmann et al.. We define a novel performance metric …

Abstract The Cayley Isomorphism problem is a much-studied problem in algebraic graph
theory. A group is a CI-group if for any two isomorphic Cayley graphs on that group. there is …