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

具有指定顶点和边轨道数的坚果图

Nut graphs with a prescribed number of vertex and edge orbits

University of Primorska(波莫尔大学);Institute of Mathematics, Physics and Mechanics(数学、物理与力学研究所);University of Niš(尼什大学)

Nino Bašić, Ivan Damnjanović

AI总结:

本文研究了具有指定顶点和边轨道数的坚果图,证明了对于任何k≥2,存在无限多个具有k个边轨道和k个弧轨道的Cayley坚果图。

摘要:

坚果图是一种非平凡图,其邻接矩阵的零空间由一个不含零元素的向量张成。最近的研究表明,坚果图的边轨道数多于顶点轨道数。此外,对于任何偶数r≥2和任何k≥r+1,都存在无限多个具有r个顶点轨道和k个边轨道的坚果图。本文在此基础上,通过寻找所有满足存在具有r个顶点轨道和k个边轨道的坚果图的(r, k)对来扩展这一结果。特别地,我们证明对于任何k≥2,都存在无限多个具有k个边轨道和k个弧轨道的Cayley坚果图。

英文摘要:

A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for any even $r \ge 2$ and any $k \ge r + 1$, there exist infinitely many nut graphs with $r$ vertex orbits and $k$ edge orbits. Here, we extend this result by finding all the pairs $(r, k)$ for which there exists a nut graph with $r$ vertex orbits and $k$ edge orbits. In particular, we show that for any $k \ge 2$, there are infinitely many Cayley nut graphs with $k$ edge orbits and $k$ arc orbits.

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

↑