基于模糊语言评估和联系数的多属性群决策方法

对方案的属性评估信息以模糊语言形式给出的多属性群决策问题,采用集对分析理论进行处理,提出了一种基于模糊语言评估和联系数的多属性群决策方法,实例应用表明了该方法的有效性和实用性.     

关于联图K_(2,n)∨P_m的邻点可区别的全染色

一个全染色被称为邻点可区别的如果它满足对任意两个相邻点所关联的色集合不同.本文给出了联图K2,n∨Pm的邻点可区别的全色数并且证明了它满足邻点可区别的全染色猜想.     

An approximation result for the interval coloring problem on claw-free chordal graphs

We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made.     

Locally conformally Hermitian-flat manifolds

We introduce the notion of a locally conformally Hermitian-flat manifold and derive a necessary and sufficient condition for a Hermitian manifold to be locally conformally Hermitian-flat. In addition, we construct a family of examples.     

Affine surfaces in R 4 with planar geodesics with respect to the affine metric

It is proved that non-degenerate surfaces in R ⁴ with planar geodesics are only the complex paraboloid and the product of two parabolas. An erratum to this article is available at .     

D(β)-vertex-distinguishing total coloring of graphs

A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance is not larger than β have different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem are presented.     

图的邻点全和可区别全染色

设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。     

子立方无爪图的单射边色数至多为6

设$G$是一个图. 图$G$的一个单射边染色是指图$G$的一个边染色, 使得距离为$2$的两条边或者在同一个三角形中的两条边染不同的颜色. 图$G$的单射边色数是指图$G$的任意单射边染色所需要的最少颜色数. 关于单射边色数有一个猜想: 任意一个子立方图的单射边色数都不超过$6$. 在本文中, 我们证明了这个猜想对子立方无爪图是成立的, 并且给出图例说明上界$6$是紧的. 同时, 我们的证明隐含了求解这类图不超过$6$种颜色的单射边染色方案的一个线性时间算法.     

无侧移半刚性连接组合框架的稳定分析:(Ⅰ)柱的有效长度系数方程

本文基于钢结构设计规范GB50017-2003,利用三柱子框架模型,考虑了连接的非线性弯矩-转角关系和楼板组合效应的影响,推导了无侧移半刚性连接组合框架柱的有效长度系数方程式,同时考虑了梁端和柱远端不同约束情况对有效长度系数的影响。另外,分析了GB50017规范附录D表D-1求解的精确性。研究表明,当柱远端刚接时,推导的方程式类似于GB50017规范附录D表D-1给出的无侧移刚接框架柱的有效长度系数计算公式;对于三柱子框架模型,当柱远端铰接时,用GB50017规范附录D表D-1得到的有效长度系数设计柱是不安全的,但最大误差只有11%。     

半刚性钢框架的内力分析

采用二阶非线性分析方法分析和设计半刚性钢框架，包括连接的柔性以及构件的几何非线性的影响，提出了半刚性钢框架中梁柱单元刚度矩阵和半刚性梁的单元刚度矩阵；推导了半刚性梁在集中荷载，均布荷载，线性荷载作用下的固端弯矩的求解公式；连接的柔性对无支撑框架的侧移有很大的影响，设计时通过变化连接的刚度以平衡梁的跨中和端弯矩。