Some identities for enumerators of circulant graphs
Combinatorics
2010-03-17 v1 Number Theory
Abstract
We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected circulants and the number of undirected self-complementary circulants of prime order is equal to the number of directed self-complementary circulants of the same order. Keywords: circulant graph; cycle index; cyclic group; nearly doubled primes; Cunningham chain; self-complementary graph; tournament; mixed graph
Cite
@article{arxiv.math/0104131,
title = {Some identities for enumerators of circulant graphs},
author = {Valery A. Liskovets},
journal= {arXiv preprint arXiv:math/0104131},
year = {2010}
}
Comments
17 pages, 3 tables Categories: CO Combinatorics (NT Number Theory) Math Subject Class: 05C30; 05A19; 11A41