arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.5514math.COcs.DM
收藏

三次图的遗传理论

Genetic Theory for Cubic Graphs

Pouya Baniasadi, Vladimir Ejov, Jerzy Filar, Michael Haythorpe

摘要:

我们提出将未标记的连通三次图集划分为两个不相交的子集,分别称为基因和后代,其中后代的基数远大于基因的基数。这两个子集之间的关键区别是后代中存在特殊的边割集,称为crackers。我们表明,每一个后代可以创建从一个有限集的基因,并引入所需的饼干由特殊的育种操作。我们证明,它总是可以识别基因,可用于生成任何给定的后代,并提供逆操作,使他们的重建。一些有趣的属性的基因可能会被继承的后代,因此,我们提出了一个自然的算法,分解成它的祖先基因的后代。我们推测,每个后代只能从一组独特的祖先基因开始产生。后者得到了数值实验的支持。

英文摘要:

We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much larger than that of the genes. The key distinction between the two subsets is the presence of special edge cut sets, called crackers, in the descendants. We show that every descendant can be created by starting from a finite set of genes, and introducing the required crackers by special breeding operations. We prove that it is always possible to identify genes that can be used to generate any given descendant, and provide inverse operations that enable their reconstruction. A number of interesting properties of genes may be inherited by the descendant, and we therefore propose a natural algorithm that decomposes a descendant into its ancestor genes. We conjecture that each descendant can only be generated by starting with a unique set of ancestor genes. The latter is supported by numerical experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑