可定向曲面上两个地图的交叉数

In this paper, we discuss the crossing numbers of two one-vertex maps on orientable surfaces. By using a reductive method, we give the crossing number of two one-vertex maps with one face on an orientable surface and the crossing number of a one-vertex map with one face and a one-vertex map with two faces on an orientable surface. This provides a lower bound for the crossing number of two general maps on an orientable surface.     

一类非凸不可微规划的算法

讨论一类带非凸不可微函数约束的非凸不可微规划的求解,提出一种基于分枝定界技巧的算法,该算法具有全局收敛性．     

一类非凸不可微规划的算法

讨论一类带非凸不可微函数约束的非凸不可微规划的求解．提出一种基于分枝定界技巧的算法,该算法具有全局收敛性。     

闭曲面丛的一类曲面连通和中的本质闭曲面

In this paper, we will characterize all types of essential closed surfaces in a class of surface sum ofI-bundle of closed surfaces, and give an application of the classificatioa in the surface sum of two 3-manifolds.     

关于Newton级数的符号算子方法

In this paper, we present several expansions of the symbolic operator （1 ＋E）^x. Moreover, we derive some series transforms formulas and the Newton generating functions of {f（k）}.     

一类循环图中的Eulerian定向数

一般的图中Eulerian定向数的计数是#P-完全问题,但对于某些特殊图中的Eulerian定向数给出精确计数是完全有可能的.通过拆分解构的方法可以找到与一类循环图中Eulerian定向数有关的递推关系,从而给出该数的精确计数.前人的工作在于给出了一些近似估计.     

K2,4×Sn的交叉数

Garey和Johnson证明了确定图的交叉数是一个NP-完全问题.确定了笛卡尔积图$K_{2,4}\times S_{n}$的交叉数是$Z(6,n)+4n.$ 当$m\geq 5,$猜想${\rm cr}(K_{2,m}\timesS_{n})={\rm cr}(K_{2,m,n})+n\lfloor\frac{m}{2}\rfloor\lfloor\frac{m-1}{2}\rfloor$.     

一类新的带参数的Hilbert 型积分不等式

In this paper it is shown that a new Hilbert-type integral inequality can be established by introducing two parameters m（m ∈ N） and λ（λ 0）.And the constant factor expressed by the Bernoulli number and π is proved to be the best possible.And then some important and especial results are enumerated.As applications,some equivalent forms are given.     

混合序列的一类强大数定律

将独立情形的Wittmann型强大数定律推广到混合序列情形,丰富了混合序列的强极限理论.     

关于任意随机变量序列泛函的一类强偏差定理

通过概率空间上的任意随机变量的分布与独立分布的比较.研究任意随机变量序列泛函的强偏差定理,即小偏差定理.将已有的某些连续型及离散随机变量序列的强偏差定理加以推广.     

On the Crossing Number of Circular Graphs

1.IntroductionInVLSIchipdesign,thetwo-layerroutingofgraphGplayanimportantrole.Thatis,theupperlayercanonlybeusedforverticalwiringandthesecondlaer,theloweroneonlyforhorizontalwiring.Soweconsidertheplanarprojectionofth.etwolayers,i.e.,consideratwodimensionalgridasapropergraphmodel.ThenoneobviousconditiontoberequiredisthateveryvertexofGhasitsdegreeatmost4.Withoutlossofgeneralitylweonlyconsider4regUlargraphs.IfGisaplanargraphwitha(G)S4,alinearalgorithmhadbeenprovidedforfindingarectilineajrrout…     

On the Pseudolinear Crossing Number

A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The pseudolinear crossing number of a graph G is the minimum number of pairwise crossings of edges in a pseudolinear drawing of G. We establish several facts on the pseudolinear crossing number, including its computational complexity and its relationship to the usual crossing number and to the rectilinear crossing number. This investigation was motivated by open questions and issues raised by Marcus Schaefer in his comprehensive survey of the many variants of the crossing number of a graph.     

关于循环图交叉数的新上界

本文给出循环图Ｃ（ｎ,ｍ）,ｎ　６,２　ｍ,交叉数的新上界．     

Characterizing Graphs with Crossing Number at Least 2

Our main result includes the following, slightly surprising, fact: a 4‐connected nonplanar graph G has crossing number at least 2 if and only if, for every pair of edges having no common incident vertex, there are vertex‐disjoint cycles in G with one containing e and the other containing f.     

On the Crossing Number of without Computer Assistance

We present several general results about drawings of , as a beginning to trying to determine its crossing number. As application, we give a complete proof that the crossing number of K₉ is 36 and that all drawings in one large, natural class of drawings of K₁₁ have at least 100 crossings.     

Triple Crossing Numbers of Graphs

We introduce the triple crossing number,a variation of the crossing number,of a graph,which is the minimal number of crossing points in all drawings of the graph with only triple crossings.It is defined to be zero for planar graphs,and to be infinite for non-planar graphs which do not admit a drawing with only triple crossings.In this paper,we determine the triple crossing numbers for all complete multipartite graphs which include all complete graphs.     

$W_m$与$P_n$ 的笛卡儿积图的交叉数

Most results on crossing numbers of graphs focus on some special graphs, such as the Cartesian products of small graphs with path, star and cycle. In this paper, we obtain the crossing number formula of Cartesian products of wheel Wm with path Pn, for arbitrary m ≥ 3 and n≥ 1.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

交叉数为2且因子图为路的笛卡尔积图

M.Kle??和J.Petrillová刻画了当G1为圈且cr (G1G2)=2时,因子图G1和G2所满足的充要条件.在此基础上,该文进一步刻画了在cr (G1G2)=2的前提下,当G1=P4,或者G1=P3且△(G2)=4时,因子图G2应满足的充要条件.