Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

在几何和参数上表示同一条曲线的两条有理NURBS曲线的权与控制顶点之间的关系

The paper discusses the relationship between weights and control vertices of two rational NURBS curves of degree two or three with all weights larger than zero when they represent the same curve parametrically and geometrically, and gives sufficient and necessary conditions for coincidence of two rational NURBS curves in non-degeneracy case.     

Optimal algebraic multilevel preconditioning for local refinement along a line

The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper.     

Halin-图的点强全染色

图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度．     

On the chromatic polynomial of a graph

Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()^α≤≤ () ^{n −ω}. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() ^{n −ω}≤μ(G)≤n−α() ^α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

关于半无爪图点泛圈性的两个结果

给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果.     

The six-vertex model eigenvectors as critical limit of the eight-vertex model bethe ansatz

The critical limit of the eight-vertex model eigenvectors obtained by means of the generalized Bethe Ansatz is shown to give the six-vertex eigenvectors as constructed in a previous paper by two of the authors. Furthermore, an explicit mapping is established between these eigenvectors and the usual Bethe Ansatz eigenvectors of the six-vertex model. This allows one to show that the indexv labeling the eight-vertex eigenstates becomes exactly the third component of the total spin in the critical limit.     

m-aryn-cube网络的最优路由

基于可选邻接点的概念,在m-ary n-cube网络中提出一种新的最优寻径算法.这种算法始终在当前结点的可选邻接点中选取最空闲邻接点作为下一个信息传输点.该算法使得从源结点到达目的结点路由是最短路由也是最快速路由,而且在多项式时间内可以完成.     

Solution Transformations and Their Effects on the Systems with Open Boundary Conditions

The solution transformations and properties of the R-matrices for two-component systems under these transformations are analyzed in details.Not all transformed R-matrices can be put into the Skalyanin‘s formalism.For those R-matrices with all required properties,the effects of solution transformations to the six-and eight-vertex systems with open boundary conditions are discussed.these effects can be one of the following types:the Hamiltonian is invariant or transposition-invariant or made in a similarity transformation,or its coupling coefficients are multiplied by an overall factor,or the spin of the system is rotated around the z axis or/and reflected with respect to some plane.In these cases,the transformed systems remain to be integrable.