B. Codenotti, I. Gerace and S. Vigna. Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs. Linear Algebra Appl., 285(1{ 3):123-142, 1998.  Home/Search   Document Details and Download   Summary   Related Articles

....is a challenging problem [12, 14] Currently, the problem is still open even if we restrict our attention to circulant graphs [2, 7] i.e. Cayley graphs de ned on Zn . The problem is known to be polynomial only for speci c classes of circulant graphs, e.g. those with a prime number of vertices [6, 15]. In this paper, we study a variant of the graph isomorphism problem. Given two (properly or not) arc colored digraphs G 1 = V 1 ; E 1 ) and G 2 = V 2 ; E 2 ) these two digraphs are said color isomorphic if there exists an isomorphism from G 1 to G 2 that preserves the colors. More formally, ....

B. Codenotti, I. Gerace and S. Vigna. Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs. Linear Algebra Appl., 285(1{ 3):123-142, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC