首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
61. IntroductionLet G be a discrete (not necessarily abelian) group. For any subset G of G, we saythat (G, G ) is a quasi-partial ordered group if e 6 G , G ' G G G and G = G ' G ',where e is the unit of G and G ' = {g--' I g e G }; further, (G, G ) is referred to as aquasi-ordered group if G = G u G '. Note that when G7 = G n G ' = {e}, a quasi-partial ordered group (resp. quasi-ordered group) (G, G ) is known as a pajrtially ordered(resp. ordered) group.Let { 6, I g e G } b…  相似文献   

2.
Let G be a locally compact but non-compact abelian group,It is proved thatM(A_p(G),L_1(G))=M(G)and M(A_p(G),L_1(G)∩C_0(G))=M(L_1(G),L_1(G)∩C_0(G)).If G is discrete,then M(A_p(G),L_1(G))=A_p(G),M(A_p,(G),L_1(G)∩C_0(G))=A_p(G).  相似文献   

3.
第一类图的若干充分性条件   总被引:7,自引:0,他引:7  
1964年,V.G.Vizing[2]证明了简单图 G 的边色数 x′(G)满足△(G)≤x′(G)≤△(G)+1.其中△(G)为图 G 的最大度.若x′(G)=△(G),则称 G 为第一类图,并简记为 G∈C~1;若 x′(G)=△(G)+1 则称 G 为第二类图,并简记为 G∈C~2.  相似文献   

4.
设 G 是简单连通图,由 Vizing 定理知,△(G)≤x′(G)≤△(G)+1,其中△(G)表示图 G 的最大顶点次,x′(G)是 G 的边色数.若 x′(G)=△(G),则称 G 为第一类图,记为 G∈C~1;否则称 G 为第二类图,记为 G∈C~2.其它图论术语及记号均与[1]一致.令 F={u|d(u)=△(G),u∈y(G)},记 GΔ=G[F].一条边 e(或顶点 v)称  相似文献   

5.
孙良 《应用数学》1992,5(1):29-34
设G是n阶连通图.γ_c(G),d_c(G),i(G)和ir(G)分别表示G图的连通Domination数,连通Domatic数,独立Domination数和Irredundance数,k(G)表示G的连通度.本文证明了下列结论. (1) 如n≥3,则i(G) γ_c(G)≤n [n/3]-2; (2) γ_c(G)≤4ir(G)-2; (3) γ_c(G)≤k(G) 1; (4) 如G≠K_n,则d_c(G)≤k(G). 此外,本文给出了满足等式γ_c(G) γ_c(G)=n和γ_c(G) γ_c(G)=n 1的图G的一个特征.  相似文献   

6.
边色数分类的两个充要条件   总被引:1,自引:0,他引:1  
赵诚 《应用数学学报》1989,12(3):349-354
设图 G 是简单连通图,从 Vizing 定理可知:Δ(G)≤x′(G)≤Δ(G) 1,其中Δ(G)表示图 G 的最大顶点次,x(G)是图 G 的边色数.若 x′(G)=Δ(G),则称 G 为第一类图,并简记为 G∈C~1;否则称 G 为第二类图并简记为 G∈C~2;本文的目的在于讨论边色数分类问题.  相似文献   

7.
赵诚 《应用数学》1989,2(4):85-87
设图G为简单连通图,由Vizing定理知:Δ(G)≤x′(G)≤Δ(G) 1,其中Δ(G)表示图G的最大顶点次,x′(G)为图G的边色数。若x′(G)=Δ(G),则称G为第一类图,记为G∈C~1;若x′(G)=Δ(G) 1,则称G为第二类图,记为G∈C~2。其他图论术语见一般参考书。一边e(或者顶点v)称为临界的,如果成立x′(G)>x′(G\e)(或者x′(G)>x′(G\v))。图G称为是临界的,如果G∈C~2,且G的每一边是临界的。对于v∈V(G),令d~*(v)=|{u|(v,u)∈E(G)且d(u)=Δ(G)}|。设F={u|d(u)=Δ(G),u∈V(G)},记G_Δ=G[F]。令图G_Δ的圈秩数为b(G_Δ)。  相似文献   

8.
设G1和G2是两个连通图,则G1和G2的Kronecker积G1×G2定义如下:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,v1)(u2,v2):u1u2∈E(G1),v1v2∈E(G2)}.我们证明了G×Kn(n≥4)超连通图当且仅当κ(G)n>δ(G)(n 1),其中G是任意的连通图,Kn是n阶完全图.进一步我们证明了对任意阶至少为3的连通图G,如果κ(G)=δ(G),则G×Kn(n≥3)超连通图.这个结果加强了郭利涛等人的结果.  相似文献   

9.
外平面图的全染色与列表全染色   总被引:1,自引:0,他引:1  
本文证明了,如果G是满足条件Δ(G)≥4的外平面图,则x_T~L(G)=Δ(G) 1,同时对Δ(G)=3给出了XT(G)=Δ(G) 1的简短的新证明,从而蕴含Δ(G)≥3时,XT(G)=Δ(G) 1,其中XT(G)是G的点边全色数,x_T~L(G)是G的点边列表全色数。  相似文献   

10.
设群 G 是有限群,a,b∈G,称 a~(-1)b~(-1)ab 为 G 的一个换位元.由 G 的全部换位元生成的子群 G′称为 G 的换位子群.很明显,G′是 G 的正规子群.当 G 是非交换单群时,G′=G,这说明,任何一个非交换单群 G 的每个元素都是 G 的换位元的乘积.但是否就  相似文献   

11.
(NCI)算子与(NFI)算子   总被引:1,自引:0,他引:1  
引入两类与不变子空间密切相关的算子,即(NCI)算子与(NFI)算子.考虑这两类算子的性质,例如存在性,相似不变性,以及与强不可约算子的关系等.并在可分Banach空间上讨论谱为单点集{0}的算子能否小紧摄动成为(NFI)算子.  相似文献   

12.
设OI_n是[n]上的保序严格部分一一变换半群.对任意1≤k≤n-1,研究半群OI_n(k)={α∈OI_n:(■x∈dom(α))x≤k■xα≤k}的秩,证明了半群OI_n(k)的秩为n+1.  相似文献   

13.
王继顺 《数学杂志》2012,32(2):363-368
本文研究了圈Cm和路Pm的Mycielski图的点可区别边染色问题.利用构造法给出了M(Cm)图的点可区别边染色法,得到了它的点可区别边色数,进而从图的结构关系,有效获得了M(Pm)图的相应点可区别边染色法和其边色数.该方法对研究存在结构关系的图染色问题具有重要的借鉴意义.  相似文献   

14.
We consider the group G:= SU(2) × ... × SU(2) (l factors), where SU(2) is the group of unitary 2 × 2 matrices with unit determinant. Let K ≃ SU(2) be the diagonal subgroup of G. We obtain the generating function of all K-spherical functions on G.  相似文献   

15.
Summary The functional inequalityf(x + y) + f(xy) f(x) + f(y) + f(x)f(y), solved for a real continuous function, differentiable at zero.
  相似文献   

16.
Because of its numerous applications to physics, there have been many solutions published on the problem of reducing a given irreducible representation (irrep) of the unitary unimodular group SU(3) into irreps of the proper orthogonal subgroup SO(3). Such solutions are generally based on an arbitrary construction of a nonorthogonal basis of the highest weight space for an irrep of SO(3), followed by an equally arbitrary orthonormalization procedure. This paper presents a unique solution of this problem based on the intrinsic structure of the multiplicity function, which is a function M L(p, q) giving the number of times irrep[L] of SO(3) is contained in irrep[pq0] of SU(3). This structure is implemented uniquely into the reduction problem through the use of the SU(3) pattern calculus.Work performed under the auspices of the U.S. Department of Energy.  相似文献   

17.
We relate the “Fourier” orbital integrals of corresponding spherical functions on thep-adic groups SO(5) and PGL(2). The correspondence is defined by a “lifting” of representations of these groups. This is a local “fundamental lemma” needed to compare the geometric sides of the global Fourier summation formulae (or relative trace formulae) on these two groups. This comparison leads to conclusions about a well known lifting of representations from PGL(2) to PGSp(4). This lifting produces counter examples to the Ramanujan conjecture.  相似文献   

18.
优美图可用在图论中的某些H-分解问题中,很多人研究无向图的优美标号.研究有向优美标号,通过对阶数奇偶性的讨论,给出了n(≥2)阶有向路(向量)P_n和n(≥3)阶有向(向量)C_n圈是有向优美的充分条件.  相似文献   

19.
We prove new results about the vector field problem on the real flag manifolds O(n)/O(1) x O(1) x O(n - 2). For some infinite families of these manifolds, we completely solve the vector field problem.  相似文献   

20.
We prove the nonsimplicity of a finite group containing an involution τ such that the quotient group C(τ)/{τ} the Frobenius group with an additional factor of odd prime order acting transitively on the nonunit elements of the kernel. Based on this we obtain a characterization of the linear groups PSL(2,11) and PSL(2,13).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号