Some Identities for Enumerators of Circulant Graphs

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We establish analytically several new identities connecting enumerators of different types of circulant graphs mainly of prime, twice prime and prime-squared orders. In particular, it is shown that the half-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. Several identities hold only for prime orders p such that (p + 1)/2 is also prime Some conjectured generalizations and interpretations are discussed.

Cite

CITATION STYLE

APA

Liskovets, V. (2003). Some Identities for Enumerators of Circulant Graphs. Journal of Algebraic Combinatorics, 18(3), 189–209. https://doi.org/10.1023/B:JACO.0000011937.70237.0b

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free