排序方式: 共有13条查询结果,搜索用时 0 毫秒
1.
2.
A map is singular if each edge is on the same face on a surface (i.e., it has only one face on a surface). In this paper we present the chromatic enumeration for rooted singular maps on the Klein bottle. 相似文献
3.
A map is bisingular if each edge is either a loop (This paper only considersplanar loop) or an isthmus (i.e., on the boundary of the same face). This paper studies thenumber of rooted bisingular maps on the sphere and the torus, and also presents formulaefor such maps with three parameters: the root-valency, the number of isthmus, and thenumber of planar loops. 相似文献
4.
5.
首先由完全图K19的两种电流图满足KCL电流定律,建立线性方程组,利用计算机求出方程组的所有解,由一组解对应K18电流图的一种电流赋值方式,得到两种电流图的不同电流赋值方式数为34和6,然后求出K19两种电流图的基础图在可定向曲面上分别有16种不同的单面嵌入;由上面的结论得到完全图K19在可定向曲面上至少有640种不同... 相似文献
6.
7.
It is well known that singular maps (i. e. ,those have only one face on a surface)play a key role in the theory of up-embeddability of graphs. In this paper the number of rooted singular maps on the Klein bottle is studied. An explicit form of the enumerating function according to the root-valency and the size of the map is determined. Further ,an expression of the vertex partition function is also found. 相似文献
8.
9.
研究了不可定向曲面上最大亏格嵌入的估计数,得到了几类图的指数级不可定向最大亏格嵌入的估计数的下界.利用电流图理论,证明了完全图K_(12s)在不可定向曲面上至少有2~(3s-1)个最小亏格嵌入;完全图K_(12s+3)在不可定向曲面上至少有2~(2s)个最小亏格嵌入;完全图K_(12s+7)在不可定向曲面上至少有2~(2s+1)个最小亏格嵌入. 相似文献
10.
本文研究了平面上一般带根地图的色和与双色和,得到了这类地图的色和与双色和函数方程。从这类地图的色和函数方程,导出了平面上一般无环地图、平面上二部地图和平面上欧拉地图的计数函数方程。还得到了一些计数函数的计数显式。 相似文献