共查询到20条相似文献,搜索用时 31 毫秒
2.
本文证明了文[1]给出的环C_(4t+1)和C_(4t+3)是算术图的如下猜想. 猜想 (1)若C_(4t+1)是(k,d)算术图,则k=2dt+2r;(2)若C_(4t+3)是(k,d)算术图,则k=(2t+1)d+2r,其中r是非负整数. 证明只证(1),证明(2)的方法与(1)类似.不妨设C_(4t+1)=(u_0,u_1,…,u_(4t),u_0)的顶点标 相似文献
3.
M. LASHKARIZADEH BAMI 《数学学报(英文版)》2008,24(4):607-610
In the present paper, it is shown that, for a locally compact commutative hypergroup K with a Borel measurable weight function w, the Banach algebra L^1 (K, w) is semisimple if and only if L^1 (K) is semisimple. Indeed, we have improved compact groups to the general setting of locally a well-krown result of Bhatt and Dedania from locally compact hypergroups. 相似文献
4.
Shi Rong Li 《数学学报(英文版)》2008,24(4):647-654
Let F be a saturated formation containing the class of supersolvable groups and let G be a finite group. The following theorems are shown: (1) G ∈ F if and only if there is a normal subgroup H such that G/H ∈ F and every maximal subgroup of all Sylow subgroups of H is either c-normal or s-quasinormally embedded in G; (2) G ∈F if and only if there is a soluble normal subgroup H such that G/H∈F and every maximal subgroup of all Sylow subgroups of F(H), the Fitting subgroup of H, is either e-normally or s-quasinormally embedded in G. 相似文献
5.
In the present paper,the shape-preserving properties and the monotonicity for convex functions of Stancu operator are given.Moreover,the simultaneous approximation problems of this operator are also considered. 相似文献
6.
8.
9.
Yu Cheng Li 《数学学报(英文版)》2008,24(10):1737-1750
In this paper, using the matrix skills and operator theory techniques we characterize the commutant of analytic Toeplitz operators on Bergman space. For f(z) = z^ng(z) (n ≥1), g(z) = b0 + b1z^p1 +b2z^p2 +.. , bk ≠ 0 (k = 0, 1, 2,...), our main result is =A′(Mf) = A′(Mzn)∩A′(Mg) = A′(Mz^s), where s = g.c.d.(n,p1,p2,...). In the last section, we study the relation between strongly irreducible curve and the winding number W(f,f(α)), α ∈ D. 相似文献
10.
11.
Petr Vojtěchovský 《Journal of Graph Theory》2009,61(2):98-110
A cycle in an edge‐colored graph is said to be rainbow if no two of its edges have the same color. For a complete, infinite, edge‐colored graph G, define Then ??(G) is a monoid with respect to the operation n°m=n+ m?2, and thus there is a least positive integer π(G), the period of ??(G), such that ??(G) contains the arithmetic progression {N+ kπ(G)|k?0} for some sufficiently large N. Given that n∈??(G), what can be said about π(G)? Alexeev showed that π(G)=1 when n?3 is odd, and conjectured that π(G) always divides 4. We prove Alexeev's conjecture: Let p(n)=1 when n is odd, p(n)=2 when n is divisible by four, and p(n)=4 otherwise. If 2<n∈??(G) then π(G) is a divisor of p(n). Moreover, ??(G) contains the arithmetic progression {N+ kp(n)|k?0} for some N=O(n2). The key observations are: If 2<n=2k∈??(G) then 3n?8∈??(G). If 16≠n=4k∈??(G) then 3n?10∈??(G). The main result cannot be improved since for every k>0 there are G, H such that 4k∈??(G), π(G)=2, and 4k+ 2∈??(H), π(H)=4. © 2009 Wiley Periodicals, Inc. J Graph Theory 相似文献
12.
证明了对于正整数k,n,si,ti(si,ti≥2,i=1,2,…,n),图n/U/i=1,Ksi,ti是k-优美图;对于正整数k,d(d≥2),k≠0(roodd)及n,si,ti(si,ti≥2,i=1,2,…,n),图n/U/i=1,Ksi,ti是(k,d)-算术图,前一结论推广了文[6]的相应结果。 相似文献
13.
In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:131‐143, 2011 相似文献
14.
令$K_{n}^{c}$表示$n$ 个顶点的边染色完全图.令 $Delta^{mon}(K_{n}^{c})$表示$K^c_{n}$的顶点上关联的同种颜色的边的最大数目.如果$K_{n}^{c}$中的一个圈(路)上相邻的边染不同颜色,则称它为正常染色的.B. Bollob'{a}s和P. Erd\"{o}s (1976) 提出了如下猜想:若 $Delta^{{mon}}(K_{n}^{c})色的Hamilton圈. 这个猜想至今还未被证明.我们研究了上述条件下的正常染色的路和圈. 相似文献
15.
Mateja ajna 《组合设计杂志》2002,10(1):27-78
We show that the necessary conditions for the decomposition of the complete graph of odd order into cycles of a fixed even length and for the decomposition of the complete graph of even order minus a 1‐factor into cycles of a fixed odd length are also sufficient. © 2002 John Wiley & Sons, Inc. J Combin Designs 10: 27–78, 2002 相似文献
16.
We construct a new symmetric Hamilton cycle decomposition of the complete graph Kn for odd n > 7. © 2003 Wiley Periodicals, Inc. 相似文献
17.
Shung‐Liang Wu 《组合设计杂志》2012,20(1):23-39
In this article, it is proved that for each even integer m?4 and each admissible value n with n>2m, there exists a cyclic m‐cycle system of Kn, which almost resolves the existence problem for cyclic m‐cycle systems of Kn with m even. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:23–39, 2012 相似文献
18.
Let n≥2 be an integer. The complete graph Kn with a 1‐factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that Kn−F has a decomposition into Hamilton cycles which are symmetric with respect to the 1‐factor F if and only if n≡2, 4 mod 8. We also show that the complete bipartite graph Kn, n has a symmetric Hamilton cycle decomposition if and only if n is even, and that if F is a 1‐factor of Kn, n, then Kn, n−F has a symmetric Hamilton cycle decomposition if and only if n is odd. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:1‐15, 2010 相似文献
19.
In this paper, we study the existence problem for cyclic ‐cycle decompositions of the graph , the complete multipartite graph with parts of size , and give necessary and sufficient conditions for their existence in the case that . 相似文献
20.
对于简单图G=〈V,E〉,如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1}满足:1)对任意的u,v∈V,若u≠v,则f(u)≠f(v);2)max{f(v)|v∈V}=2|E|-1;3)对任意的e_1,e_2∈E,若e_1≠e_2,则g(e_1)≠g(e_2),此处g(e)=|f(u)+f(v)|,e=uv;4)|g(e)|e∈E}={1,3,5,…,2|E|-1},则称G为奇优美图,f称为G的奇优美标号.设G=〈V,E〉是一个无向简单图.如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1},满足:1)f是单射;2)■uv∈E(G),令f(uv)=f(u)+f(v),有{f(uv)|uv∈E(G)}={1,3,5,…,2|E|-1},则称G是奇强协调图,f称为G的.奇强协调标号或奇强协调值.给出了链图、升降梯等几类有趣图的奇优美标号和奇强协调标号. 相似文献