Algorithmic aspects of algebraic methods for graph isomorphism testing

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
7 pages, 1 figure

Keywords

Combinatorics, 05C85; 05C60; 68R10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/108847

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0602071
 http://arxiv.org/abs/math/0602071

Collections

arXiv