Abstract
In this paper we present a time-polynomial recognition algorithm for certain classes of circulant graphs. Our approach uses coherent configurations and Schur rings generated by circulant graphs for elucidating their symmetry properties and eventually finding a cyclic automorphism.
| Original language | English |
|---|---|
| Pages (from-to) | 1-32 |
| Number of pages | 32 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 8 |
| Issue number | 1 R |
| DOIs | |
| State | Published - 1 Jan 2001 |
| Externally published | Yes |
Keywords
- Association schemes
- Circulant graphs
- Schur rings
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Recognizing circulant graphs in polynomial time: An application of association schemes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver