arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.04254math.COcs.DM
收藏

坚果图的生成及其性质

Generation and properties of nut graphs

Kris Coolsaet, Patrick W. Fowler, Jan Goedgebeur

摘要:

一个坚果图是一个至少有2个顶点的图,它的邻接矩阵具有零值1,并且它的非平凡核向量不包含零。化学图是连通的,最大度不超过3。提出了一种新的非同构螺母图的穷举生成算法。利用这个算法,我们确定了所有的螺母图多达13个顶点和所有的化学螺母图多达22个顶点。此外,我们确定了所有的坚果图的立方多面体中的34个顶点和所有的坚果富勒烯高达250个顶点。坚果图是感兴趣的化学共轭体系,在模型的电子结构,自由基反应和分子传导。化学坚果图的相关数学性质是图谱中零特征值的位置,以及核特征向量项的幅度的分散($r$:项的最大与最小幅度的比率)。这里生成的所有坚果图都收集了这些属性的统计数据。我们还表明,所有的化学坚果图有$r \ge 2$,并有至少一个化学坚果图与$r = 2$的每一个订单$n \ge 9$(与$n = 10$除外)。

英文摘要:

A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non-trivial kernel vectors do not contain a zero. Chemical graphs are connected, with maximum degree at most three. We present a new algorithm for the exhaustive generation of non-isomorphic nut graphs. Using this algorithm, we determined all nut graphs up to 13 vertices and all chemical nut graphs up to 22 vertices. Furthermore, we determined all nut graphs among the cubic polyhedra up to 34 vertices and all nut fullerenes up to 250 vertices. Nut graphs are of interest in chemistry of conjugated systems, in models of electronic structure, radical reactivity and molecular conduction. The relevant mathematical properties of chemical nut graphs are the position of the zero eigenvalue in the graph spectrum, and the dispersion in magnitudes of kernel eigenvector entries ($r$: the ratio of maximum to minimum magnitude of entries). Statistics are gathered on these properties for all the nut graphs generated here. We also show that all chemical nut graphs have $r \ge 2$ and that there is at least one chemical nut graph with $r = 2$ for every order $n \ge 9$ (with the exception of $n = 10$).

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

↑