首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
In this note, we prove that if G is a finite group, then G is p-nilpotent if and only if there exists a positive integer n such that for any x,y∈G.  相似文献   

2.
For a monoid M, we introduce the concept of skew strongly M-reversible rings which is a generalization of strongly M-reversible rings, and investigate their properties. It is shown that if G is a finitely generated Abelian group, then G is torsion-free if and only if there exists a ring R with |R| ≥ 2 such that R is skew strongly G-reversible. Moreover, we prove that if R is a right Ore ring with classical right quotient ring Q, then R is skew strongly M-reversible if and only if Q is skew strongly M-reversible.  相似文献   

3.
A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by χ a(G), is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that χ a(G) ≤Δ(G) + 22, if G is a triangle-free 1-planar graph.  相似文献   

4.
Let G be a finite group and K a field of characteristic zero.It is well-known that if K is a splitting field for G,then G is abelian if and only if any irreducible representation of G has degree 1.In this paper,we generalize this result to the case that K is an arbitrary field of characteristic zero(that is,K need not be a splitting field for G),and we also obtain the orthogonality relations of irreducible K-characters of G in this case.Our results generalize some well-known theorems.  相似文献   

5.
51. IntroductionIt is quite clear that the ekistence of complements for some families of subgroups of agroup gives a lot ofinfor~ion about its structure. FOr instance, Hall[6] proved that a groupG is supersoluble with elementary abelian Sylow subgroups if and only if G is complemellted,that is, every subgroup of G is comPlemeded in G. The same anchor also proved that agroup is soluble if and only if every Sylow subgroup is complemellted (see [3;I,3.5]). Morerecelltly, Arad and Wardll] pro…  相似文献   

6.
A graph G is induced matching extendable if every induced matching of G is included in a perfect matching of G. A graph G is generalized induced matching extendable if every induced matching of G is included in a maximum matching of G. A graph G is claw-free, if G dose not contain any induced subgraph isomorphic to K1,3. The k-th power of G, denoted by Gu, is the graph with vertex set V(G) in which two vertices are adjacent if and only if the distance between them is at most k in G. In this paper we show that, if the maximum matchings of G and G3 have the same cardinality, then G3 is generalized induced matching extendable. We also show that this result is best possible. As a result, we show that if G is a connected claw-flee graph, then G3 is generalized induced matching extendable.  相似文献   

7.
A vertex x in a graph G strongly resolves a pair of vertices v, w if there exists a shortest x-w path containing v or a shortest x-v path containing w in G. A set of vertices S■V(G) is a strong resolving set of G if every pair of distinct vertices of G is strongly resolved by some vertex in S. The strong metric dimension of G, denoted by sdim(G), is the minimum cardinality over all strong resolving sets of G. For a connected graph G of order n≥2, we characterize G such that sdim(G) equals 1, n-1, or n-2, respectively. We give a Nordhaus-Gaddum-type result for the strong metric dimension of a graph and its complement: for a graph G and its complement G, each of order n≥4 and connected, we show that 2≤sdim(G)+sdim(G)≤2( n-2). It is readily seen that sdim(G)+sdim(G)=2 if and only if n=4; we show that, when G is a tree or a unicyclic graph, sdim(G)+sdim(G)=2(n 2) if and only if n=5 and G ~=G ~=C5, the cycle on five vertices. For connected graphs G and G of order n≥5, we show that 3≤sdim(G)+sdim(G)≤2(n-3) if G is a tree; we also show that 4≤sdim(G)+sdim(G)≤2(n-3) if G is a unicyclic graph of order n≥6. Furthermore, we characterize graphs G satisfying sdim(G)+sdim(G)=2(n-3) when G is a tree or a unicyclic graph.  相似文献   

8.
INDEPENDENT-SET-DELETABLE FACTOR-CRITICAL POWER GRAPHS   总被引:3,自引:0,他引:3  
It is said that a graph G is independent-set-deletable factor-critical (in short, ID-factor-critical), if, for every independent set 7 which has the same parity as |V(G)|, G-I has a perfect matching. A graph G is strongly IM-extendable, if for every spanning supergraph H of G, every induced matching of H is included in a perfect matching of H. The k-th power of G, denoted by Gk, is the graph with vertex set V(G) in which two vertices are adjacent if and only if they have distance at most k in G. ID-factor-criticality and IM-extendability of power graphs are discussed in this article. The author shows that, if G is a connected graph, then G3 and T(G) (the total graph of G) are ID-factor-critical, and G4 (when |V(G)| is even) is strongly IM-extendable; if G is 2-connected, then D2 is ID-factor-critical.  相似文献   

9.
In 2003, Borodin and Raspaud proved that if G is a plane graph without 5-circuits and without triangles of distance less than four, then G is 3-colorable. In this paper, we prove that if G is a plane graph without 5- and 6-circuits and without triangles of distance less than 2, then G is 3-colorable.  相似文献   

10.
A total k-coloring of a graph G is a coloring of V(G) ∪ E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ'(G) is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree Δ≥ 9, then χ'(G) = Δ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then χ'(G) = 9.  相似文献   

11.
12.
We study a class of self-similar processes with stationary increments belonging to higher order Wiener chaoses which are similar to Hermite processes. We obtain an almost sure wavelet-like expansion of these processes. This allows us to compute the pointwise and local Hölder regularity of sample paths and to analyse their behaviour at infinity. We also provide some results on the Hausdorff dimension of the range and graphs of multidimensional anisotropic self-similar processes with stationary increments defined by multiple Wiener–Itô integrals.  相似文献   

13.
It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.  相似文献   

14.
Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.  相似文献   

15.
As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years (2001-2005). The main topics are: convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.  相似文献   

16.
张丽娜  吴建华 《数学进展》2008,37(1):115-117
One of the most fundamental problems in theoretical biology is to explain the mechanisms by which patterns and forms are created in the'living world. In his seminal paper "The Chemical Basis of Morphogenesis", Turing showed that a system of coupled reaction-diffusion equations can be used to describe patterns and forms in biological systems. However, the first experimental evidence to the Turing patterns was observed by De Kepper and her associates(1990) on the CIMA reaction in an open unstirred reactor, almost 40 years after Turing's prediction. Lengyel and Epstein characterized this famous experiment using a system of reaction-diffusion equations. The Lengyel-Epstein model is in the form as follows  相似文献   

17.
18.
19.
20.
<正>Submission Authors must use LaTeX for typewriting,and visit our website www.actamath.com to submit your paper.Our address is Editorial Office of Acta Mathematica Sinica,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,P.R.China.  相似文献   

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

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