Cubic Cayley graphs with small diameter.
Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2.

Voir la notice de l'article provenant de la source Episciences

In this paper we apply Polya's Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group. We report the results of a search of all three-regular Cayley graphs on permutation groups of degree at most nine for small diameter graphs. We explore several methods of constructing covering graphs of these Cayley graphs. Examples of large graphs with small diameter are obtained.
@article{DMTCS_2001_4_2_a12,
     author = {Curtin, Eugene},
     title = {Cubic {Cayley} graphs with small diameter.},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {2000-2001},
     doi = {10.46298/dmtcs.285},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.285/}
}
TY  - JOUR
AU  - Curtin, Eugene
TI  - Cubic Cayley graphs with small diameter.
JO  - Discrete mathematics & theoretical computer science
PY  - 2000-2001
VL  - 4
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.285/
DO  - 10.46298/dmtcs.285
LA  - en
ID  - DMTCS_2001_4_2_a12
ER  - 
%0 Journal Article
%A Curtin, Eugene
%T Cubic Cayley graphs with small diameter.
%J Discrete mathematics & theoretical computer science
%D 2000-2001
%V 4
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.285/
%R 10.46298/dmtcs.285
%G en
%F DMTCS_2001_4_2_a12
Curtin, Eugene. Cubic Cayley graphs with small diameter.. Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2. doi : 10.46298/dmtcs.285. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.285/

Cité par Sources :