$(m,d)$-内射盖与Gorenstein $(m,d)$-平坦模

研究了$(m,d)$-内射$R$-模作成的类是(预)盖类的条件,证明了$(m,d)$-凝聚环上的每一个左$R$-模都具有$(m,d)$-内射盖.在此基础上,又引入研究了Gorenstein $(m,d)$-平坦模和Gorenstein $(m,d)$-内射模,证明了$(m,d)$-凝聚环上的左$R$-模$M$是Gorenstein$(m,d)$-平坦模的充分必要条件是它的特征模$M^{+}$是Gorenstein $(m,d)$-内射模.推广了Goresntein平坦模和Goresntein $n$-平坦模上的一些结果.     

(g,f) -因子和可扩图

设G是一个图,并设g和f是定义在V(G)上的整值函数使得对所有的点x∈ V(G)均有g(x)≤ f(x).称一个图G是(g,f,H) -可扩的,如果在删除了任意一个同构于H的子图中所有点后,剩下G的子图有一个(g,f) -因子.该文给出了(g,f,H) -可扩图的特征.进一步,研究了(g,f,H) -可扩(H=nK₁)的性质.     

关于图是(g,f,n)-临界图的充分条件

设G是一个图. 设g和f是两个定义在V(G)上的整值函数使得对V(G)所有的顶点x有g(x)f(x). 图G被称为(g,f,n)-临界图,如果删去G的任意n个顶点后的子图都含有G的(g,f)-因子. 本文给出了图是(a,b,n)-临界图几个充分条件. 进一步指出这些条件是最佳的. 例如,如果对V(G)所有的顶点x和y都有g(x)＜f(x), n+g(x)dG(x)和g(x)/(dG(x)-n)f(y)/dG(y),则G是(g,f,n)-临界图.     

分数(g,f,m)-覆盖图的充要条件

G是一个图,g和f是两个定义在V(G)上的非负整数值函数,并且对任意的x∈V(G),满足g(x)≤f(x).称图G是分数(g,f,m)-覆盖图,如果存在图G的分数(g,f)-因子G[F_h]满足对任意的e∈E(H)有h(e)=1,其中H是图G的m条边的子图.证明了一个图是分数(g,f,m)-覆盖图的充要条件,并得到了几个推论.     

关于$\{1,3,4\}$-逆的混合逆序律

In this paper, we study the mixed-type reverse order laws to {1, 3, 4}-inverses for closed range operators A, B and AB. It is shown that B{1, 3, 4}A{1, 3, 4} ?(AB){1, 3} if and only if R(A*AB) ? R(B). For every A(134)∈ A{1, 3, 4}, it has(A(134)AB){1, 3, 4}A{1, 3, 4} =(AB){1, 3, 4} if and only if R(AA*AB) ? R(AB). As an application of our results, some new characterizations of the mixed-type reverse order laws associated to the Moore-Penrose inverse and the {1, 3, 4}-inverse are established.     

利用$(s,t)$-微分算子和拟从属定义的双单叶函数新子类的系数相关问题研究

本文中,我们引进了由$(s,t)$-微分算子和拟从属定义的一类广义双单叶函数类. 对该新函数类及其子类,利用Faber多项式展开式我们得到了前两项系数$|a_2|$, $|a_3|$和一般项系数$|a_n|~(n\geq 4)$的估计,然后也解决了Fekete-Szeg\"{o}问题.     

$C(X)$上的开点与紧开拓扑

In this note we define a new topology on C(X),the set of all real-valued continuous functions on a Tychonoff space X.The new topology on C(X) is the topology having subbase open sets of both kinds:[f,C,ε[={g E C(X):|f(x)-g(x)| ε for every x∈C} and[U,r]~-={g∈C(X):g~(-1)(r)∩U≠φ},where f∈C(X),C∈KC(X)={nonempty compact subsets of X},ε 0,while U is an open subset of X and r∈R.The space C(X) equipped with the new topology T_(kh) which is stated above is denoted by C_(kh)(X).Denote X_0={x∈X:x is an isolated point of X} and X_c={x∈X:x has a compact neighborhood in X}.We show that if X is a Tychonoff space such that X_0=X_c,then the following statements are equivalent:(1) X_0 is G_δ-dense in X;(2) C_(kh)(X) is regular;(3) C_(kh)(X) is Tychonoff;(4) C_(kh)(X) is a topological group.We also show that if X is a Tychonoff space such that X_0=X_c and C_(kh)(X) is regular space with countable pseudocharacter,then X is σ-compact.If X is a metrizable hemicompact countable space,then C_(kh)(X) is first countable.     

分数(g,f)-因子覆盖图

一个图称为分烽（g,f)- 因子覆盖图，如果G中的任何一条边e都包含在一个分数（g,f)- 因子中，并且满足h(e)=1，其中h是分数（g,f)- 因子的导出函数。本文给出了一个图是分数（g,f)- 因子覆盖图的充要条件。     

完全-因子和(g,f)-对等图

若图的因子F的每一个分支都是完全图,则称F为完全-因子.本文研究了完全-因子F和(g,f)-对等图之间的关系,给出了有完全-因子F的图是(g,f)-对等图、f-对等图及k-对等图的关于F的分支的若干充分条件,并指出定理中的条件在一定意义上是最可能的,从而推广了李建湘等人的有关结果.     

Consecutive-(r,f,k)out-of-n:F和Consecutive(f,g)-out-of-(r,n):F线性系统的可靠性

Consecutive-(r,f,k)-out-of-n:F系统由n个单元顺序连结而成,仅当在连续的r个单元中,至少有f个失效或者至少连续k个失效,整个系统才失效;而Consecutive-(f,g)-out-of-(r,n):F系统由n个单元顺序连结而成,仅当在整个系统中至少有f个失效或者在连续的r个单元中,至少有g个失效,整个系统才失效。本文运用马氏链嵌入方法,在单元之间相互独立以及单元之间马氏相关这两种情况下,给出线性系统的可靠性。     

关于分数(g,f)-因子消去图

一个图称为分数（g,f）－因子消去图，如果去掉图G中的任何一条边e图G仍有一个分数（g,f）－因子。本文分别给出了一个力是分数1－因子消去图和分数2－因子消去图的几个充分条件，并给出一个图有一个分数（g,f）－因子不含给定对集中任何一条边的充要条件。     

On （g, f）-Uniform Graphs

A graph G is called a (g, f)-uniform graph if for each edge of G, there is a (g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary and sufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of this condition are discussed. In particular, some simple sufficient conditions for a graph to be an [a, b]-uniform graph are obtained for a≤b.     

Connected (g,f)‐factors

The vertex set of the reduced Kneser graph KG₂(m,2) consists of all pairs {a,b} such that a, bε{1,2,…,m} and 2≤|a?b|≤m?2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if m≥4 and m≠5, then the circular chromatic number of KG₂(m,2) is equal to m?2, its ordinary chromatic number. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 62–68, 2002     

FRACTIONAL (g, f)-FACTORS OF GRAPHS

1 IntroductionThe graphs considered in this paper will be finite undirected graphs wllicll 11lay llavemultiple edges but no loops. Let G be a grapll with vertex set V(G) and edge set E(G). Fora vertex x of G, the degree of x in G is denoted by dG(z). Let g and f be two integer-valuedfunctions defined o11 V(G) such that 0 < g(z) 5 f(x) fOr all x E V(G). Then a (g, f)-factorof G is a spanning 8ubgraph F of G satisfying g(x) < dG(z) 5 f(x) for all x E V(F). Ifg(x) = f(x) for all x E V(…     

（mg,mf）—图中具有特殊性质的（g,f）—因子

本文给出了一类带有边连通度限制的（ｍｇ,ｍｆ）－图有一个（ｇ,ｆ）因子含任一给定的边且不含其它任意给定的ｍ－１条边的一个充分必要条件,并使（１）中结果成为本文定理的推论。     

ORTHOGONAL (g,f)-FACTORIZAFIONS OF BIPARTITE GRAPHS

1 IntroductionIn this paper we con8ider finite undirected simple graphs. Let G be a graph with vertexset V(G) and edge set E(G). Let g and f be two po8itive iuteger-valued functions defined onV(G) such that g(x) 5 f(x) for every vertex x of V(G). Then a (g, f)-factor of G is a spanningsubgraph H of G satisfying g(x) 5 dH(x) 5 f(x) for each x E V(H). In particular, if G itselfis a (g, f)-factor, then G is called a (g, f)-grapl1. A subgrapl1 H of G is called an rmsubgraphif H has m edg…     

Randomly Orthogonal (g,f)-factorizations in Graphs

Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valued functions defined on V(G) such that 2k − 2 ≤ f(x) for all x ∈ V(G). Let H be a subgraph of G with mk edges. In this paper it is proved that every (mg + m − 1,mf − m + 1)-graph G has (g,f)-factorizations randomly k-orthogonal to H and shown that the result is best possible.