Recognizing circulant graphs in polynomial time: An application of association schemes

Mikhail E. Muzychuk, Gottfried Tinhofer

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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 languageEnglish
Pages (from-to)1-32
Number of pages32
JournalElectronic Journal of Combinatorics
Volume8
Issue number1 R
DOIs
StatePublished - 1 Jan 2001
Externally publishedYes

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