arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0704.1782math.COcs.NAmath.NA
收藏

二分图欧拉数的渐近性质

Asymptotics of the Euler number of bipartite graphs

Richard Ehrenborg, Yossi Farjoun

AI总结:

本文定义二分图的欧拉数为顶点标号使得局部极大值和极小值交替出现的标号个数,并通过自伴算子将某些子图的欧拉数计算问题转化为算子特征值问题,进而给出欧拉数的渐近展开。

摘要:

我们定义$n$个顶点上的二分图的欧拉数为顶点用$1,2,...,n$标号且使得顶点交替成为局部极大值和局部极小值的标号个数。我们将计算图$G$与路径$P_m$的笛卡尔积的某些子图的欧拉数问题重新表述为自伴算子的形式。欧拉数的渐近展开由相关算子的特征值给出。对于两类图,梳状图和笛卡尔积$P_2 \Box P_m$,我们数值求解了特征值问题。

英文摘要:

We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima. We reformulate the problem of computing the Euler number of certain subgraphs of the Cartesian product of a graph $G$ with the path $P_m$ in terms of self adjoint operators. The asymptotic expansion of the Euler number is given in terms of the eigenvalues of the associated operator. For two classes of graphs, the comb graphs and the Cartesian product $P_2 \Box P_m$, we numerically solve the eigenvalue problem.

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

↑