图与补图全独立数间的关系

对图G(V,E),V∪E中既不相邻、又不相关联的最大元素个数,称为G的全独立数,并简记为α_T(G)。本文研究了图和补图全独立数之间的关系,得到α_T(G) α_T(G~C)≤「3y 1/2」。其中y=|V(G)|,G~C是G的补图,「x」为不大于x的最大整数,且界可达。     

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．     

研究K4-同胚图K4(α,1,1,δ,ε,η)色性的一个引理

主要介绍了一个引理，这个引理奠定了K4－同胚图K4（α，1，1，δ，ε，η）色性研究的基础。     

Optimal Control of Non-well-posed Heat Equations

This work is concerned with Pontryagin＇s maximum principle of optimal control problems governed by some non-well-posed semilinear heat equations. A type of approach to the non-well-posed optimal control problem is given.     

Regular Balanced Cayley Maps for Cyclic, Dihedral and Generalized Quaternion Groups

A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified.     

障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.     

基于CSCW的协同编著系统的设计

讨论了计算机支持的协同工作(CSCW)的主要技术，其中重点讨论了协同编著系统设计中的并发控制技术，指出了其与传统的并发控制技术的区别。根据CSCW的基本原理设计出了一个基于Browse／Server结构的协同编著系统的系统模型。该系统模型比传统的模型更加方便了用户之间通过Internet的浏览器进行协作。     

用激光吹气注入高Z杂质使HL-1M装置放电有效地安全终止的研究

现在国际上大装置纷纷发现破裂放电而导致电流突然中止造成装置遭受重大的危害，因为能量熄灭阶段存在强烈的热通量，而且在电流熄灭阶段中产生强烈的逃逸电子，使得第一壁材料可运行的时间大大缩减；同时在真空器壁上产生很强的电磁力。所以，必须在大装置上建立一种避免和软化能量衰竭与电流衰竭，并且控制预计的放电破裂或突然终止放电的措施。     

NECESSARY CONDITIONS FOR OPTIMAL CONTROLS OF SEMILINEAR ELLIPTIC VARIATIONAL INEQUALITIES INVOLVING STATE CONSTRAINT

This paper deals with maximum principle for some optimal control problem governed by some elliptic variational inequalities. Some state constraints are discussed. The basic techniques used here are based on those in [1] and a new penalty functional defined in this paper.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.