1 Abstract In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant ii its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may… (More)
Combinatorial optimization problems defined on sets of phylogenetic trees are an important issue in computational biology, for instance the problem of reconstruction a phylogeny using maximum likelihood or parsimony approaches. The collection of possible phylogenetic trees is arranged as a so-called Robinson graph by means of the nearest neighborhood… (More)
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.
An algorithm is given for computing the values of the characteristic polynomial of a tree. Its time complexity is linear; hence, the polynomial is readily accessible from the tree and no computation is necessary to get the polynomial ready for applications. If necessary, the coefficients can be determined in time O(n 2). This improves the complexity O (n… (More)