多目标决策非凸锥Λ－有效点的存在性与控制性质

本文提出了多目标决策偏好及最优解的一般概念和集诱导偏好的概念．给出了判断ρ－完备集的一系列条件，从而指出了ρ－完备集是十分广泛的集类．得到了集合的Λ－有效点的存在性定理和ρ－下闭集与截面的Λ－有效点的性质．通过引入函数Λ－下半连续的概念，得到了多目标决策一般集诱导偏好最优解的存在性定理．在这些结果的基础上，最后得到了集合Ｙ关于Λ和多目标决策问题的控制性质．     

灰色凸集及其基本性质

本文给出了灰色凸集的定义．并证明了灰色凸集具有一般凸集完全类似的性质．     

图的定向与全有效控制

本文研究有向图的全有效控制集.通过对无圈有向图结构特征的刻画,给出了简单图G在定向D下有全有效控制集的充要条件,并对几类特殊图的全有效数进行了计算.     

换热网络布局问题的不动点集性质及计算

本应用图论,有限群对图的作用,轨道等讨论了一类不动点集的性质,并给出了具体的计算公式。     

对称本原图的集指数与本原简单图的广义上指数的极图

一个有向图D称为本原的，如果存在某个正整数k，使得对于D中的任一点x到任一点y都有长为k的途径，这样的正整数k中的最小者称为D的本原指数，作为本原指数概念的推广，R．A．Brualdi和柳柏濂于1990年引入了本原有向图的广义本原指数的新概念，本文给出了对称本原图的集指数的一些性质，并对本原简单图的广义上指数的极图进行了完全刻划。     

模型论简介

本文将模型论介绍为“可定义集的数学”．首先给出“可定义集”的确切定义，并引入处理可定义集的主要工具——一阶公式的概念．然后给出一些例子．最后介绍一些相当于可定义集的组合性质的稳定性理论．     

非对称极差控制图研究

本文针对现有的国家标准极差控制图的一些问题,在极差的统计性质的基础上,提出了非对称极差控制图的想法,并构造了三种不同的非对称极差控制图,分别给出了报警率达到0.27%时的上、下控制限系数,使得它们的控制限计算非常简便易行.本文给出了这三种非对称极差控制图的含义和各自的侧重点,并将它们与国家标准的极差控制图在对应检验的势函数以及平均运行长度两个方面进行了比较.使用这三种非对称极差控制图可以使真实报警率达到0.27%,远小于现有的国家标准极差控制图的真实报警率.无偏控制图由于具有了"无偏"这一优良性质,成为三张非对称控制图中最具吸引力的.     

图的部分控制集问题的修正 Greedy算法

部分控制集问题是对于给定的顶点赋权图G=(V,E;c)和正整数K,寻找图G一个顶点子集T,使得在其控制下的顶点个数不小于K且T中顶点权和达到最小。本文讨论了部分控制集问题的NP-困难性;给出了该问题的一种修正Greedy近似算法,并对其近似度H(K)给出了证明。     

图映射的渐近稳定集

设f为图G的连续自映射．在本文中，我们讨论了图映射的渐近稳定集，并给出了f的不动点为渐近稳定的一个充分必要条件．     

E-凸函数的若干特征

讨论了一类广义的凸集和凸函数:E-凸集和E-凸函数的若干性质,并给出E-凸函数的一个判别准则．     

Graphs with disjoint dominating and paired-dominating sets

A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a dominating set such that the subgraph induced by the dominating set contains a perfect matching. In this paper, we show that no minimum degree is sufficient to guarantee the existence of a disjoint dominating set and a paired-dominating set. However, we prove that the vertex set of every cubic graph can be partitioned into a dominating set and a paired-dominating set.     

Locating and paired-dominating sets in graphs

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.     

On the existence of total dominating subgraphs with a prescribed additive hereditary property

Recently, Bacsó and Tuza gave a full characterization of the graphs for which every connected induced subgraph has a connected dominating subgraph satisfying an arbitrary prescribed hereditary property. Using their result, we derive a similar characterization of the graphs for which any isolate-free induced subgraph has a total dominating subgraph that satisfies a prescribed additive hereditary property. In particular, we give a characterization for the case where the total dominating subgraphs are a disjoint union of complete graphs. This yields a characterization of the graphs for which every isolate-free induced subgraph has a vertex-dominating induced matching, a so-called induced paired-dominating set.     

Vertices contained in all minimum paired-dominating sets of a tree

A set S of vertices in a graph G is called a paired-dominating set if it dominates V and 〈S〉 contains at least one perfect matching. We characterize the set of vertices of a tree that are contained in all minimum paired-dominating sets of the tree.     

A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order

A paired-dominating set of a graph is a dominating set of vertices whose induced subgraph has a perfect matching, while the paired-domination number is the minimum cardinality of a paired-dominating set in the graph. Recently, Chen et al. (Acta Math Sci Ser A Chin Ed 27(1):166–170, 2007) proved that a cubic graph has paired-domination number at most three-fifths the number of vertices in the graph. In this paper, we show that the Petersen graph is the only connected cubic graph with paired-domination number three-fifths its order.     

Feedback vertex set on AT-free graphs

We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.     

Paired-Domination in Subdivided Star-Free Graphs

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by γ _pr(G), is the minimum cardinality of a paired-dominating set of G. In [Dorbec P, Gravier S, Henning MA, J Comb Optim 14(1):1–7, 2007], the authors gave tight bounds for paired-dominating sets of generalized claw-free graphs. Yet, the critical cases are not claws but subdivided stars. We here give a bound for graphs containing no induced subdivided stars, depending on the size of the star.     

Paired-Domination in <Emphasis Type="Italic">P</Emphasis><Subscript>5</Subscript>-Free Graphs

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by , is the minimum cardinality of a paired-dominating set of G. In [1], the authors gave tight bounds for paired-dominating sets of generalized claw-free graphs. Yet, the critical cases are not claws but subdivided stars. We here give a bound for graphs containing no induced P ₅, which seems to be the critical case.     

Paired-Domination in Claw-Free Graphs

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, while the paired-domination number, denoted by γ _pr (G), is the minimum cardinality of a paired-dominating set in G. In this paper we investigate the paired-domination number in claw-free graphs. Specifically, we show that γ _pr (G) ≤ (3n ? 1)/5 if G is a connected claw-free graph of order n with minimum degree at least three and that this bound is sharp.     

Characterizations of trees with equal paired and double domination numbers

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice. We show that for trees, the paired-domination number is less than or equal to the double domination number, solving a conjecture of Chellali and Haynes. Then we characterize the trees having equal paired and double domination numbers.