On Primitive Idempotents of the Strong Endomorphism Monoid of a Graph

51.IntroductionandPreIiminariesThemonoidofendomorphismsofagraph,inparticular,thatofstrongendomorphismsofagraph,hasbeentheobjectofresearchesinthetheoryofsemigroupsforquitesometime(cf.Llj-Lloj).LlJandL2jcanserveasasurvey.Theaimoftheseresearchesistocon-tributetothealgebraicanalysisofgraphs.Thesubjectyieldssomeinterestsincetheresultsoftheseresearchesmayopenvastpossibilitiesforapplicationsofsemigrouptheorytographtheo-ry.InL1]andL3j,ithasbeenprovedthatforfinitegraphG,sEnd(G),themonoidofstrongen…     

图半群中幂等元生成的子半群(英)

本文明确刻划了图的强自同态么半群中幂等元生成的子半群．     

图的强收缩核与图的强自同态幺半群的正则性

本文研究图及其强自同态幺半群．首先刻画了图的强自同态幺半群的正则元，然后给出了此幺半群正则的充要条件．这推广了［１］和［２］中关于有限图的强自同态幺半群正则的结果．     

图的字典序积和自同态幺半群

Ｆ．Ｈａｒａｒｙ￣［１］和Ｇ．Ｓａｂｉｄｕｓｓｉ￣［２］考虑过图Ｘ和ｙ的字典序积Ｘ［Ｙ］的自同构群ＡｕｔＸ［Ｙ］与它们各自的自同构群的圈积ＡｕｔＸ［ＡｕｔＹ］的关系，并给出了两者相等的一种刻划．在本文，我们考虑更广意义上的问题，即Ｘ［Ｙ］的自同态幺半群ＥｎｄＸ［Ｙ］与各自的自同态幺半群的圈积ＥｎｄＸ［ＥｎｄＹ］的关系，也给出了两者相等的一种刻划，同时得到了下面结果：如果Ｘ和Ｙ都是不含Ｋ＿３导出子图的连通图，且其中之一图有奇数围长，那么ＥｎｄＸ［Ｙ］＝ＥｎｄＸ［ＥｎｄＹ］．     

图的正则强自态的逆

本文从组合角度明确刻画了图的完全正则强自同态的交换伪逆，同时给出它们的计数公式．     

The Monoid of Hypersubstitutions of Type (n)

A hypersubstitution of type (n) is a map which takes the n-ary operation symbol f to an n-ary term (f). Any such can be inductively extended to a map on the set of all terms of type (n), and any two such extensions can be composed in a natural way. Thus, the set Hyp(n) of all hypersubstitutions of type (n) forms a monoid. For n = 2, many properties of this monoid were described by Denecke and Wismath [5]. In this paper, we study the semigroup properties of Hyp(n) for arbitrary n 2. In particular, we characterize the projection, dual and idempotent hypersubstitutions, and describe the classes of these elements under Greens relations.AMS Subject Classification (1991): 08B15 20M07Research supported by NSERC, Canada     

图半群的结构

该文在图(的自同态)半群中引入了拟格林关系概念;给出了拟格林关系的性质;然后在此基础上进一步证明了图半群的(格林关系意义上的)双重结构性质     

图的不可收缩性和end-正则性

图的半群理论是图的群理论的延伸．图的不可收缩性和end－正则性是其中受到普遍关注的课题．本文揭示了两者之间的内在联系．     

The Endomorphism Monoid of the Random Graph has Uncountably Many Ideals

In this note we prove that the monoid End(R) of all endomorphisms of the random graph R is not simple. On the contrary, the lattice of ideals of End(R) embeds the poset of all subsets of , the set of natural numbers.     

The Join of Split Graphs Whose Regular Endomorphisms Form a Monoid

In this paper, the regular endomorphisms of the join of split graphs are investigated. We give a condition under which the regular endomorphisms of the join of split graphs form a monoid.     

强自同态半群构成并群的图族

该文给出强自同态半群构成并群的图族的特征, 同时文中也明确刻划了其中每个群的单位元.     

关于奇强协调图的一些结果

对于一个(p,q)-图G,如果存在一个单射f:V(G)→{0,1,…,2q-1},使得边标号集合{f(uv)|uv∈E(G)}={1,3,5,…,2q-1},其中边标号为f(uv)=f(u)+f(v),那么称G是奇强协调图,并称f是G的一个奇强协调标号.通过研究若干奇强协调图,得出一些奇强协调图的性质.     

The join of split graphs whose half-strong endomorphisms form a monoid

In this paper, the half-strong endomorphisms of the join of split graphs are investigated. We give the conditions under which the half-strong endomorphisms of the join of split graphs form a monoid.     

平面Halin图的强最大亏格

本文给出了平面Halin图的可定向与不可定向强最大亏格．     

极大外平面图的不可定向强最大亏格

强嵌入猜想称:任意2-连通图都可以强嵌入到某一曲面上．本文通过分析极大外平面图的结构以及强嵌入的特征,讨论了该图类的不可定向强最大亏格,并给出了一个复杂度为O(nlogn)的算法．其中部分图类的强最大亏格嵌入提供该图的一个少双圈覆盖．     

Idempotent Generation in the Endomorphism Monoid of a Uniform Partition

Denote by 𝒯_n and 𝒮_n the full transformation semigroup and the symmetric group on the set {1,…, n}, and ?_n = {1} ∪ (𝒯_n?𝒮_n). Let 𝒯(X, 𝒫) denote the monoid of all transformations of the finite set X preserving a uniform partition 𝒫 of X into m subsets of size n, where m, n ≥ 2. We enumerate the idempotents of 𝒯(X, 𝒫), and describe the submonoid S = ? E ? generated by the idempotents E = E(𝒯(X, 𝒫)). We show that S = S₁ ∪ S₂, where S₁ is a direct product of m copies of ?_n, and S₂ is a wreath product of 𝒯_n with 𝒯_m?𝒮_m. We calculate the rank and idempotent rank of S, showing that these are equal, and we also classify and enumerate all the idempotent generating sets of minimal size. In doing so, we also obtain new results about arbitrary idempotent generating sets of ?_n.     

完全图的广义Mycielski图的邻强边染色

对|V(G)|≥3的连通图G,若κ-正常边染色法满足相邻点的色集合不相同,则称该染色法为κ-邻强边染色,其最小的κ称为图G的邻强边色数。张忠辅等学者猜想:对|V(G)|≥3的连通图G,G≠C_5其邻强边色数至多为△(G)+2,利用组合分析的方法给出了完全图的广义Mycielski图的邻强边色数,从而验证了图的邻强边染色猜想对于此类图成立。     

Idempotents in the Universal Compactification of a Cone

Let U be the universal (or Bohr) compactification of a real finite-dimensional cone. M. Friedberg established an isomorphism between the idempotents of U and the faces of the cone dual to K. This isomorphism is utilized to investigate the generators of the semigroup of idempotents.AMS Subject Classification (1991): 22A15 20M14 52A20     

n圈中辐图的团覆盖数和团划分数

本文主要讨论 Petersen图的一类推广图—— n圈中辐图的团覆盖数和团划分数 ,由此得出该图的团覆盖数和团划分数相等的结论 ,同时给出了其在不同情况下的计算公式 .     

关于全图的强完美性

本文证明了图Ｇ的全图Ｔ（Ｇ）是完美的充分必要条件是Ｇ的块至多含有三个点．同时，得到对全图来说强完美性猜想为真．