arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.01037math.CO
收藏

笛卡尔图乘积中的节点电阻曲率

Node resistance curvature in Cartesian graph products

Aleyah Dawkins, Vishal Gupta, Mark Kempton, William Linz, Jeremy Quail, Harry Richman, Zachary Stier

AI总结:

本文研究节点电阻曲率在笛卡尔图乘积下的表现,刻画了 m×n 网格内部与边界顶点的曲率符号,并补充 2×n 网格结果、反例及一般界。

摘要:

Devriendt 和 Lambiotte 最近提出了“节点电阻曲率”,这是一种基于有效电阻矩阵的图曲率概念。在本文中,我们开始研究节点电阻曲率在笛卡尔图乘积运算下的行为。我们研究一个自然问题:正曲率图的笛卡尔乘积的节点电阻曲率是否全局为正,并证明:只要 m,n≥3,m×n 网格内部顶点的节点电阻曲率始终非正,而在此类网格边界上则始终非负。为完整起见,我们还证明了若干关于 2×n 网格中节点电阻曲率的结果,并给出了一个推广结论的反例。我们还给出了一般界,并提出若干供未来研究的进一步问题。

英文摘要:

Devriendt and Lambiotte recently introduced the \emph{node resistance curvature}, a notion of graph curvature based on the effective resistance matrix. In this paper, we begin the study of the behavior of the node resistance curvature under the operation of the Cartesian graph product. We study the natural question of global positivity of node resistance curvature of the Cartesian product of positively-curved graphs, and prove that, whenever $m,n\ge3$, the node resistance curvature of the interior vertices of a $m\times n$ grid is always nonpositive, while it is always nonnegative on the boundary of such grids. For completeness, we also prove a number of results on node resistance curvature in $2\times n$ grids and exhibit a counterexample to a generalization. We also give generic bounds and suggest several further questions for future study.

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

↑