最大平面图GM的孪生图GTM和对角线变换DT

提出了最大平面图GM的孪生图GTM和"孪生图对"的概念和定义,探讨了"孪生图对"的特性,分析了"孪生图对"的四色着色方案彼此间的关系,并由此形成了最大平面图着色的"对角线变换法".文中以二个实例("正二十面体的平面嵌入图";"Appel和Haken的例子")验证了研究的结果,同时也显示了孪生图GTM可被应用的场合及其实用性.     

不含K3的平面图最多是-4可着色的

提出了一种证明"四色猜想"的新思路.证明了"四色猜想"的一部分,即不含K3的平面图最多是-4可着色的,指出了另一部分的证明思路.     

图与其Mycielski图关联色数的关系

本文证明了对n阶图G,若其最大度△(G)的2倍不等于n,且G的关联色数等于△(G) 1,则M(G)的关联色数为△(M(G)) 1．同时还研究了树和完全二部图的Mycielski图的关联色数．文末提出了M(G)的关联色数猜想,其中M(G)为图G的Mycielski图．     

联图的关联着色

图G的一个κ-关联着色是指从G的关联集I(G)到颜色集{1,2,…,κ}的一个映射,满足任意一对相邻的关联分配到不同的颜色.使得G有κ-关联着色的最小的数κ称为G的关联色数,记为X_i(G).研究了联图的关联着色,给出了G∨H的关联色数的一个上界,讨论了路与路,路与圈,圈与圈的联图的关联色数.     

极大外平面图的星边染色

如果图G的一个正常边染色使得G中没有长为4的路或4-圈是2-边染色的,则称此染色是G的一个星边染色.对G进行星边染色所需的最少颜色数称为G的星边色数,记作x′s(G).该文证明了最大度为4的极大外平面图的星边色数等于6,对任一n(≥8)阶极大外平面图Gn,有6≤x′s(Gn)≤n-1成立,并且上界和下界都是可达的.     

极大外平面图（r,k）——扇的4染色

定义了一类极大外平面图：(r,k）--扇。证明了当G是以r个顶点的圈Qr为标定界环的(r,k）一扇，G'是以Qr为标定界环的任意极大外平面图时，G和G'有公共四染色；同时对△(G)=r-3的极大外平在图也得到相同的结论。从而证明了四色定理的等价命题在给定条件下成立。     

关于图的L(3,2,1)-标号问题

图G的L( 2 ,1 )标号是一个从顶点集V(G)到非负整数集的函数f(x) .使得若d(x ,y) =1 .则｜f(x) -f(y) ｜≥ 2 ;若d(x ,y) =2 ,则｜f(x) -f(y)｜≥ 1 .图G的L( 2 ,1 )标号数λ(G)是使得G有max{f(v) ∶v∈V(G) }=k的L( 2 ,1 )标号中的最小数k .本文将L( 2 ,1 ) 标号问题推广到更一般的情形即L( 3,2 ,1 ) 标号问题 .我们首先定义了图G的顶点 3 着色及图的 3 色数 χ3 (G)等有关概念 ,并推导出 3 色数 χ3 (G)的上界 ;然后根据 χ3 (G)与λ3 (G)的关系 ,得出了对一般图G ,有λ3 (G) ≤ 3maxH Gδ(H) (Δ2 -Δ 1 )这一一般关系式 ;最后证明了对一般平面图G ,有λ3 (G)≤ 1 5(Δ2 -Δ 1 ) ,并得出了其它几类平面图的λ3 (G)的上界 .     

最大平面图G_M的孪生图G_M~T和对角线变换DT

提出了最大平面图G_M的孪生图G_M~T和"孪生图对"的概念和定义,探讨了"孪生图对"的特性,分析了"孪生图对"的四色着色方案彼此间的关系,并由此形成了最大平面图着色的"对角线变换法".文中以二个实例("正二十面体的平面嵌入图";"Appel和Haken的例子")验证了研究的结果,同时也显示了孪生图G_M~T可被应用的场合及其实用性.     

关于图K_(2n)-E(C_4)的点可区别边色数

图G的一个k-正常边染色f被称为点可区别边染色是指任何两点的点及其关联边的色集合不同,所用最小的正整数k被称为G的点可区别边色数,记为x′_(vd)(G).用K_(2n)-E(C_4)表示2n阶完全图删去其中一条4阶路的边后得到的图,文中得到了K_(2n)-E(_4)的点可区别边色数.     

系列平行图SHMeredith图的关联着色

图的关联着色是从关联集到颜色集的一个映射,使得关联集中任何两个相邻的关联都具有不同的像.确定了Meredith图的关联色数,证明了对任意系列平行图都存在一个(Δ 2,2)-关联着色.     

“运价”为负的运输模型计算机求解问题的处理

为解决一些计算机软件求解"运价"既有正值又有负值运输模型时"不可求解"的问题,本文采用"运价同额增减法"决策模型转换的方法,将原模型的"运价"全部转换为正值后再用计算机软件求解,并分别编写了EXCEL求解模板和求解程序对该方法的计算加以印证。结果表明,采用该方法求解得出的最优解(最优决策方案)与原模型求得的最优解完全一样,而最优值(最优决策效果)减去虚增(或加上虚减)的部分就是原模型的最优值。采用这种方法能成功地解决一些计算机软件"不可求解"的问题。     

Domination in generalized Petersen graphs

Generalized Petersen graphs are certain graphs consisting of one quadratic factor. For these graphs some numerical invariants concerning the domination are studied, namely the domatic number , the total domatic number and the -ply domatic number for and . Some exact values and some inequalities are stated.     

关于图P_n~k的均匀染色

对简单图G=〈V,E〉及自然数k,令V(Gk) =V(G) ,E(Gk) =E(G)∪{uv|d(u,v) =k},其中d(u,v)表示G中u,v的距离,称图Gk为G的k方图.本文讨论了路的k方图Pkn的均匀点染色、均匀边染色和均匀邻强边染色,利用图的色数的基本性质和构造染色函数的方法,得到相应的色数χev(Pkn) ,χ′ee(Pkn) ,χ′eas(Pkn) .并证明猜想“若图G有m -EASC,则一定有m +1 -EASC”对Pkn是正确的.     

Unions of Sets Starshaped via Staircase Paths or via Paths of Bounded Length

Let S be an orthogonal polygon in the plane, S simply connected, and let k=2,3. Set S is a union of k sets starshaped via staircase paths if and only if for every F finite, F bdry S, there is a set G bdry S arbitrarily close to F and points si,1 ik, (depending on G) such that each point of G is clearly visible from some si. An analogous result holds for a union of 2 sets starshaped via -paths when S is a closed simply connected set in the plane. Each result is best possible.     

The geometric invariants $${\Omega^{n}}$$ of a product of groups

We compute the geometric invariants of a product G × H of groups in terms of and . This gives a sufficient condition in terms of and for a normal subgroup of G × H with abelian quotient to be of type F _n . We give an example involving the direct product of the Baumslag–Solitar group BS_1,2 with itself.      

On <Emphasis Type="Italic">S</Emphasis>-quasinormal and <Emphasis Type="Italic">c</Emphasis>-normal subgroups of a finite group

Let be a saturated formation containing the class of supersolvable groups and let G be a finite group. The following theorems are presented: (1) G ∈ if and only if there is a normal subgroup H such that G/H ∈ and every maximal subgroup of all Sylow subgroups of H is either c-normal or S-quasinormally embedded in G. (2) G ∈ if and only if there is a normal subgroup H such that G/H ∈ and every maximal subgroup of all Sylow subgroups of F*(H), the generalized Fitting subgroup of H, is either c-normal or S-quasinormally embedded in G. (3) G ∈ if and only if there is a normal subgroup H such that G/H ∈ and every cyclic subgroup of F*(H) of prime order or order 4 is either c-normal or S-quasinormally embedded in G. Supported by the Natural Science Foundation of China and the Natural Science Foundation of Guangxi Autonomous Region (No. 0249001). Corresponding author. Supported in part by the Natural Science Foundation of China (10571181), NSF of Guangdong Province (06023728) and ARF(GDEI).     

Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems

The paper describes new results in the field of multiobjective optimization techniques. The Interactive Decision Maps (IDM) technique is based on approximation of Feasible Criterion Set (FCS) and subsequent visualization of the Pareto frontier of FCS by interactive displaying the bi-criteria slices of FCS. The Estimation Refinement (ER) method is now the main method for approximating convex FCS in the framework of IDM. The properties of the ER method are studied. We prove that the number of facets of the approximation constructed by ER and the number of the support function calculations of an approximated set are asymptotically optimal. These results are important from the point of view of real-life applications of ER.     

On one-sided strong Arens irregularity

We present a natural class of Banach algebras which are one-sided strongly Arens irregular. More precisely, for any non-compact, second countable locally compact group , we show that the convolution algebras of nuclear operators on , as introduced and studied by the author in [3], [6], are left but not right strongly Arens irregular. For Heinz K?nig, in admiration and friendship     

On automorphisms of A-groups

Let G be an A-group (i.e. a group in which xx ^α  = x ^α x for all and let denote the subgroup of Aut(G) consisting of all automorphisms that leave invariant the centralizer of each element of G. The quotient is an elementary abelian 2-group and natural analogies exist to suggest that it might always be trivial. It is shown that, in fact, for any odd prime p and any positive integer r, there exist infinitely many finite pA-groups G for which has rank r. Received: 23 March 2008, Revised: 20 May 2008     

Two-parameter p, q-variation Paths and Integrations of Local Times

In this paper, we prove two main results. The first one is to give a new condition for the existence of two-parameter -variation path integrals. Our condition of locally bounded -variation is more natural and easy to verify than those of Young. This result can be easily generalized to multi-parameter case. The second result is to define the integral of local time pathwise and then give generalized It’s formula when is only of bounded -variation in . In the case that is of locally bounded variation in , the integral is the Lebesgue–Stieltjes integral and was used by Elworthy, Truman and Zhao. When is of only locally -variation, where , , and , the integral is a two-parameter Young integral of -variation rather than a Lebesgue–Stieltjes integral. In the special case that is independent of , we give a new condition for Meyer's formula and is defined pathwise as a Young integral. For this we prove the local time is of -variation in for each , for each almost surely (-variation in the sense of Lyons and Young, i.e. ).