共查询到20条相似文献,搜索用时 109 毫秒
1.
本文研究图及其强自同态幺半群.首先刻画了图的强自同态幺半群的正则元,然后给出了此幺半群正则的充要条件.这推广了[1]和[2]中关于有限图的强自同态幺半群正则的结果. 相似文献
2.
本文给出了具有完全正则自同态半群的分裂图的结构特征.其证明方法有望应用于其他图族自同态半群的正则性及完全正则性的研究. 相似文献
3.
4.
图的强化缩核与图的强自同态幺半群的正则性 总被引:1,自引:0,他引:1
本文研究图及其强自同态幺半群,首先刻画了图的强自同态幺半群的正则元,然后给出了此幺半群正则的充要条件,这推广了(1)和(2)中关于有限图的强自同态幺半群正则的结果。 相似文献
5.
乔占科 《纯粹数学与应用数学》1995,(1)
本文分别给出П正则半群的幂等元同余类和Пorthodox半群[1]的幂等元同余类的П正则性刻画.其次,证明П逆半群或完全П正则半群S的幂等元同余类是S的П正则子半群.最后讨论orthodox半群的幂等元同合类的正则性. 相似文献
6.
7.
8.
乔占科 《纯粹数学与应用数学》1995,11(1):69-71
本文分别给出Ⅱ正则半群的幂等元同余类和Ⅱorthodox半群的幂等元同余类的Ⅱ正则性刻画,其次,证明Ⅱ逆半群或完全Ⅱ逆半群或完全Ⅱ正则半群S的幂等元同余类是S的Ⅱ正则子半群。最后讨论orhtodox半群的幂等元同余类的正则性。 相似文献
9.
10.
图的字典序积和自同态幺半群 总被引:4,自引:1,他引:3
F.Harary ̄[1]和G.Sabidussi ̄[2]考虑过图X和y的字典序积X[Y]的自同构群AutX[Y]与它们各自的自同构群的圈积AutX[AutY]的关系,并给出了两者相等的一种刻划.在本文,我们考虑更广意义上的问题,即X[Y]的自同态幺半群EndX[Y]与各自的自同态幺半群的圈积EndX[EndY]的关系,也给出了两者相等的一种刻划,同时得到了下面结果:如果X和Y都是不含K_3导出子图的连通图,且其中之一图有奇数围长,那么EndX[Y]=EndX[EndY]. 相似文献
11.
Michael Krivelevich Benny Sudakov Nicholas Wormald 《Random Structures and Algorithms》2011,38(3):235-250
An old problem of Erd?s, Fajtlowicz, and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on vertices. Motivated by this problem, we consider the order of such a subgraph in a typical graph on vertices, i.e., in a binomial random graph . We prove that with high probability a largest induced regular subgraph of has about vertices. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 235–250, 2011 相似文献
12.
保持两个等价关系的变换半群的Green关系 总被引:2,自引:0,他引:2
Let Tx be the full transformation semigroup on a set X. For a non-trivial equivalence F on X, let
TF(X) = {f ∈ Tx : arbieary (x, y) ∈ F, (f(x),f(y)) ∈ F}.
Then TF(X) is a subsemigroup of Tx. Let E be another equivalence on X and TFE(X) = TF(X) ∩ TE(X). In this paper, under the assumption that the two equivalences F and E are comparable and E lohtain in F, we describe the regular elements and characterize Green's relations for the semigroup TFE(X). 相似文献
TF(X) = {f ∈ Tx : arbieary (x, y) ∈ F, (f(x),f(y)) ∈ F}.
Then TF(X) is a subsemigroup of Tx. Let E be another equivalence on X and TFE(X) = TF(X) ∩ TE(X). In this paper, under the assumption that the two equivalences F and E are comparable and E lohtain in F, we describe the regular elements and characterize Green's relations for the semigroup TFE(X). 相似文献
13.
A bounded linear operator A on a Banach space is called relatively regular, if there is a bounded linear operator B such that ABA=A. In this case B is called a g1-inverse of A. In this paper we characterize some classes of relatively regular operators A via the set {B1-B2:B1 and B2 are g1-inverses of A}. 相似文献
14.
一类广义变换半群的格林关系 总被引:1,自引:0,他引:1
设X是一个全序集,E是X上的一个凸等价关系.令
OE(X)={f∈TE(X):Ax,y∈X,x≤y→f(x)≤f(y)),
其中TE(X)是E-保持变换半群.对于取定的θ∈OE(X),在OE(X)上定义运算fog=fθg,使OE(X)成为广义半群OE(X;θ).对于有限全序集X上的凸等价关系E,本文刻画了广义半群OE(X;θ)的正则元,描述了这个半群的格林关系. 相似文献
15.
Notion of metrically regular property and certain types of point-based approximations are used for solving the nonsmooth generalized equation f(x)+F(x)?0,where X and Y are Banach spaces,and U is an open subset of X,f:U→Y is a nonsmooth function and F:X■Y is a set-valued mapping with closed graph.We introduce a confined Newton-type method for solving the above nonsmooth generalized equation and analyze the semilocal and local convergence of this method.Specifically,under the point-based approximation of f on U and metrically regular property of f+F,we present quadratic rate of convergence of this method.Furthermore,superlinear rate of convergence of this method is provided under the conditions that f admits p-point-based approximation on U and f+F is metrically regular.An example of nonsmooth functions that have p-point-based approximation is given.Moreover,a numerical experiment is given which illustrates the theoretical result. 相似文献
16.
In this paper, generalizing the result in [9], I construct strongly regular Cayley graphs by using union of cyclotomic classes of and Gauss sums of index w, where is even. In particular, we obtain three infinite families of strongly regular graphs with new parameters. 相似文献
17.
18.
退化时滞微分系统的可解性 总被引:8,自引:0,他引:8
本文中我们研究退化量滞微分系统E./x(t)=Ax(t) Bx(t-1) f(t).给出其标准型,研究这种类型退化时滞微分系统,并就其可解性的唯一性得到一些结果。 相似文献
19.
A graph is antimagic if there is a one‐to‐one correspondence such that for any two vertices , . It is known that bipartite regular graphs are antimagic and nonbipartite regular graphs of odd degree at least three are antimagic. Whether all nonbipartite regular graphs of even degree are antimagic remained an open problem. In this article, we solve this problem and prove that all even degree regular graphs are antimagic. 相似文献