@article{ALSPACH2002527,
    Abstract = {This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the directed and undirected cases of the following three families are studied: Cayley graphs on cyclic groups, known as circulant graphs, of square-free order, circulant graphs of arbitrary order n whose connection sets are subsets of the group of units of Zn, and Cayley graphs on elementary abelian groups. Resum{\'e} Cet article traite du d{\'e}nombrement de quelques familles de graphes de Cayley, simples ou orient{\'e}s. On consid{\`e}re les deux cas, simple et orient{\'e}s, des trois familles suivantes: la famille des graphes de Cayley sur les groupes cyclique, appel{\'e}s graphes circulants, dont l'ordre est un entier sans carr{\'e}, la famille des graphes circulants d'ordre n quelconque dont l'ensemble des connecteurs est un sous-ensemble du groupe des unit{\'e}s de Zn, ainsi que la famille des graphes de Cayley sur les groupes ab{\'e}liens {\'e}l{\'e}mentaires.},
    Author = {Alspach, Brian and Mishna, Marni},
    File = {Enumeration of Cayley graphs and digraphs - 1-s2.0-S0012365X02003199-main - a.pdf},
    ISSN = {0012-365X},
    Journal = {Discrete Mathematics},
    Keywords = {Cayley graphs, Cycle index series, Enumeration},
    Note = {LaCIM 2000 Conference on Combinatorics, Computer Science and Appl ications},
    Number = {3},
    Pages = {527-539},
    Title = {Enumeration of Cayley graphs and digraphs},
    URL = {https://www.sciencedirect.com/science/article/pii/S0012365X02003199},
    Volume = {256},
    Year = {2002},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0012365X02003199},
    bdsk-url-2 = {https://doi.org/10.1016/S0012-365X(02)00319-9},
    date-added = {2023-03-13 07:42:38 +0100},
    date-modified = {2023-03-13 07:42:38 +0100},
    doi = {10.1016/S0012-365X(02)00319-9}
}

@article{ALSPACH2002527, Abstract = {This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the directed and undirected cases of the following three families are studied: Cayley graphs on cyclic groups, known as circulant graphs, of square-free order, circulant graphs of arbitrary order n whose connection sets are subsets of the group of units of Zn, and Cayley graphs on elementary abelian groups. Resum{\'e} Cet article traite du d{\'e}nombrement de quelques familles de graphes de Cayley, simples ou orient{\'e}s. On consid{`e}re les deux cas, simple et orient{\'e}s, des trois familles suivantes: la famille des graphes de Cayley sur les groupes cyclique, appel{\'e}s graphes circulants, dont l'ordre est un entier sans carr{\'e}, la famille des graphes circulants d'ordre n quelconque dont l'ensemble des connecteurs est un sous-ensemble du groupe des unit{\'e}s de Zn, ainsi que la famille des graphes de Cayley sur les groupes ab{\'e}liens {\'e}l{\'e}mentaires.}, Author = {Alspach, Brian and Mishna, Marni}, File = {Enumeration of Cayley graphs and digraphs - 1-s2.0-S0012365X02003199-main - a.pdf}, ISSN = {0012-365X}, Journal = {Discrete Mathematics}, Keywords = {Cayley graphs, Cycle index series, Enumeration}, Note = {LaCIM 2000 Conference on Combinatorics, Computer Science and Appl ications}, Number = {3}, Pages = {527-539}, Title = {Enumeration of Cayley graphs and digraphs}, URL = {https://www.sciencedirect.com/science/article/pii/S0012365X02003199}, Volume = {256}, Year = {2002}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0012365X02003199}, bdsk-url-2 = {https://doi.org/10.1016/S0012-365X(02)00319-9}, date-added = {2023-03-13 07:42:38 +0100}, date-modified = {2023-03-13 07:42:38 +0100}, doi = {10.1016/S0012-365X(02)00319-9} }