2018/10/01 by Matthew Delacorte, Delacorte, M.
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #DNA and Biological Computing #FOS: Computer and information sciences #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1810.00876
openalex publication_date 2018/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.