Algorithmic aspects of algebraic methods for graph isomorphism testing

Simple item page
dc.creatorKaukic, Michal
dc.date2006-02-04
dc.date.accessioned2026-07-07T07:03:06Z
dc.date.available2026-07-07T07:03:06Z
dc.descriptionWe 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.
dc.description7 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0602071
dc.identifierhttp://arxiv.org/abs/math/0602071
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108847
dc.subjectCombinatorics
dc.subject05C85; 05C60; 68R10
dc.titleAlgorithmic aspects of algebraic methods for graph isomorphism testing
dc.typetext

Files

Collections

arXiv