arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.13876math.COmath-phmath.ATmath.MP
收藏

彩色嵌入图的图多项式:一种拓扑方法

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

Indian Institute of Science Education & Research, Mohanpur(印度科学教育研究所莫汉布尔分校);Indian Institute of Science Education and Research Pune(印度科学教育研究所浦那分校);TCG CREST

Somnath Basu, Dhruv Bhasin, Siddhartha Lal, Siddhartha Patra

AI总结:

本文提出一种基于代数拓扑的图多项式,用于研究嵌入定向曲面的有限图,并分析其彩色变体及在基本操作下的变化,应用于图类检测和拓扑纠缠熵。

摘要:

我们通过为有限图关联一个多项式来研究嵌入在定向曲面中的有限图。发展此类图多项式理论所用的工具是代数拓扑的,而多项式本身则受到物理学中思想的启发。我们还分析了这些多项式在彩色嵌入图上的变体。这被用来描述在基本图论操作下多项式的变化。最后,我们给出了该多项式的若干应用,包括检测某些图类以及该多项式与拓扑纠缠熵的联系。

英文摘要:

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

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

↑