Algorithmic aspects of algebraic methods for graph isomorphism testing

Details Algorithmic aspects of algebraic methods for graph isomorphism testing Algorithmic aspects of algebraic methods for graph isomorphism testing

2006-02-04

arxiv.org/abs/math/0602071v1

Mathematics

Combinatorics

7 pages, 1 figure

Scientific paper

We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the local complements and values of determinants of their adjacency matrices. All known non-isomorphic SRG-s (with no more than 64 vertices) are distinguishable by this method.

Affiliated with

Also associated with

No associations

Rating

Algorithmic aspects of algebraic methods for graph isomorphism testing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic aspects of algebraic methods for graph isomorphism testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic aspects of algebraic methods for graph isomorphism testing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-699217