关于n-可扩图的一些结果

本文讨论了关于m-可扩图的两个极值问题；并考查了下述图类的n-可扩性；正则偶图，单位区间图和分裂图。     

一类裂变图的L(0,1,2 d,d,1)-标号数上界

将图的标号问题由每个顶点需要一个标号的情况推广到每个顶点需要多个标号的情况,给出裂变图的概念以及赋权图的L(0,1,2 d,d,1)-标号的概念,给出R-单位球图对应裂变图的L(0,1,2 d,d,1)-标号数的一个上界.     

一类裂变图的$L(^{0,1,2}_{d,d,1})$-标号数上界

将图的标号问题由每个琢真需要一个标号的情况推广到每个顶点需要多个标号的情况，给出裂变图的概念以及赋权图的L（0,1,2↑ d,d,1）-标号的概念，给出R．单位球图对应裂变图的L（0,1,2↑ d,d,1）-标号数的一个上界．     

一族OWA袋映射带有单位的若干充分条件

本文首先讨论了ＯＷＡ袋映射何时带有固定单位，给出了ＯＷＡ袋映射带有固定单位的充要条件，其次又给出了两类特殊的ＯＷＡ袋映射－ＯＣＷＡ袋映射和ＮＣＷＡ袋映射带有固定单位和自单位的若干充分条件。     

OPTIMAL LABELLING OF UNIT INTERVAL GRAPHS

This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, modified cutwidth, and bandwidth sum(linear arrangement).     

《浙江医学》对计量单位的要求

本刊执行GB3100～3102—1993（（量和单位》中有关量、单位和符号的规定及其书写规则,具体执行可参照中华医学会杂志社编写的《法定计量单位在医学上的应用》。注意单位名称与单位符号不可混用。组合单位符号中表示相除的斜线多于1条时应采用负数幂的形式表示,组合单位中斜线和负数幂亦不可混用,     

用单位分数的一个性质解题

人们通常把分子是1的分数称为单位分数，古埃及人对单位分数情有独衷，做了大量的研究，掌握了单位分数的许多性质，因此单位分数也被誉为埃及分数．将单位分数的某些性质应用到数学解题中往往能起到事半功倍的效果．本文仅讨论单位分数以下性质：     

人力资源管理在地勘单位管理中的重要性

目前,地勘单位仍旧属于是事业单位性质,对地勘单位来说,人力资源管理对其人才的保证有直接影响,其工作做得好与坏,直接关系地勘单位的发展,在地勘单位管理中有非常重要的作用。     

Г-环的单位元

Γ-环的乘法单位元比结合环的乘法单位元更复杂,更富有变化.首先它有单位元,α-单位元(强单位元)之分,其次它具有与结合环单位元相异的性质,对此本文逐一阐述.此外还探讨了Γ-环M与其矩阵环M_m,n单位元间的关系.在导入Γ-环的特征这一概念后,证明了具有单位元Γ-环的特征的一些性质.     

单位圆上正交多顶式及其导数

对单位圆上关于有限正Ｂｏｒｅｌ测度的正交多项式导数的渐近性质的研究在七十年代已有所结果和突破，如熟知的Ｓｚｅｇｏｅ理论等。然而对其微分性质的分析和讨论并不算多，即使如此，也只是限于考虑单位圆上正交多项式的某些特殊类型＾［４］。本文证明单位圆上正交多项式序列的导数仍然是单位圆上正交多项式序列，并给出它们与相关微分方程之间的一些关系。     

4p阶3度点传递图

一个图称为点传递图,如果它的全自同构群在它的顶点集合上作用传递.证明了一个4p(p为素数)阶连通3度点传递图或者是Cayley图,或者同构于下列之一;广义Petersen图P(10,2),正十二面体,Coxeter图,或广义Petersen图P(2p,k),这里k2≡-1(mod 2p).     

The clique-separator graph for chordal graphs

We present a new representation of a chordal graph called the clique-separator graph, whose nodes are the maximal cliques and minimal vertex separators of the graph. We present structural properties of the clique-separator graph and additional properties when the chordal graph is an interval graph, proper interval graph, or split graph. We also characterize proper interval graphs and split graphs in terms of the clique-separator graph. We present an algorithm that constructs the clique-separator graph of a chordal graph in O(n³) time and of an interval graph in O(n²) time, where n is the number of vertices in the graph.     

关于联图P_1VP_n的k-强优美性

本文研究了联图P_1VP_n的k-强优美性问题.利用K-强优美图的定义,获得了联图P_1VP_n是k-强优美图的必要条件,还得到了当n:2k-1时联图P_1VP_n是k-强优美图,亦是k-优美图,及当n≥3时联图P_1VP_n是2-强优美图,也是2-优美图的结果,推广了联图P_1VP_n是优美图的结果.     

Cover-incomparability graphs and chordal graphs

The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs.     

开关图的几个代数性质

首先对开关图的自同构群进行了研究,随即讨论了它的点传递性,并得到Calyley图的开关图依然是Cayley图.     

1-平面图及其子类的染色

如果图G可以嵌入在平面上,使得每条边最多被交叉1次,则称其为1-可平面图,该平面嵌入称为1-平面图.由于1-平面图G中的交叉点是图G的某两条边交叉产生的,故图G中的每个交叉点c都可以与图G中的四个顶点(即产生c的两条交叉边所关联的四个顶点)所构成的点集建立对应关系,称这个对应关系为θ.对于1-平面图G中任何两个不同的交叉点c_1与c_2(如果存在的话),如果|θ(c_1)∩θ(c_2)|≤1,则称图G是NIC-平面图;如果|θ(c_1)∩θ(c_2)|=0,即θ(c_1)∩θ(c_2)=?,则称图G是IC-平面图.如果图G可以嵌入在平面上,使得其所有顶点都分布在图G的外部面上,并且每条边最多被交叉一次,则称图G为外1-可平面图.满足上述条件的外1-可平面图的平面嵌入称为外1-平面图.现主要介绍关于以上四类图在染色方面的结果.     

Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes

A retract of a graph Γ is an induced subgraph Ψ of Γ such that there exists a homomorphism from Γ to Ψ whose restriction to Ψ is the identity map. A graph is a core if it has no nontrivial retracts. In general, the minimal retracts of a graph are cores and are unique up to isomorphism; they are called the core of the graph. A graph Γ is G‐symmetric if G is a subgroup of the automorphism group of Γ that is transitive on the vertex set and also transitive on the set of ordered pairs of adjacent vertices. If in addition the vertex set of Γ admits a nontrivial partition that is preserved by G, then Γ is an imprimitive G‐symmetric graph. In this paper cores of imprimitive symmetric graphs Γ of order a product of two distinct primes are studied. In many cases the core of Γ is determined completely. In other cases it is proved that either Γ is a core or its core is isomorphic to one of two graphs, and conditions on when each of these possibilities occurs is given.     

四圈图的Spread

图的spread定义为图的邻接矩阵的最大特征值与最小特征值的差.本文确定了n(n≥84)顶点四圈图中spread最大的唯一的图.     

Cubic vertex-transitive graphs of girth six

In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth 6 is obtained. It is proved that every such graph, with the exception of the Desargues graph on 20 vertices, is either a skeleton of a hexagonal tiling of the torus, the skeleton of the truncation of an arc-transitive triangulation of a closed hyperbolic surface, or the truncation of a 6-regular graph with respect to an arc-transitive dihedral scheme. Cubic vertex-transitive graphs of girth larger than 6 are also discussed.     

正则图的变换图的谱

设G是一个图,类似全图的定义,可以定义G的8种变换图.如果G是正则图,那么图G的变换图的谱都可以由图G的谱计算得到.