Graph Isomorphism by Conversion to Chordal (6, 3) Graphs
Computational Complexity
2018-10-03 v1
Abstract
Babel has shown that for an extended class of chordal (6, 3) graphs the coarsest regular simplicial partition is equivalent to the graph's automorphism partition. We give a reversible transformation for any graph to one of these graph by using Booth's reduction of a graph to a chordal graph and elimination of Babel's forbidden subgraphs for these graphs by adding edges to them.
Keywords
Cite
@article{arxiv.1810.00876,
title = {Graph Isomorphism by Conversion to Chordal (6, 3) Graphs},
author = {M. Delacorte},
journal= {arXiv preprint arXiv:1810.00876},
year = {2018}
}