首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
An f-edge cover-colouring of a graph G = (V, E) is an assignment of colours to the edges of G such that every colour appears at each vertex υ∈ V at least f(υ) times.The maximum number of colours needed to f-edge cover colour G is called the f-edge cover chromatic index of G, denoted by χfc(G). This paper gives that min[d(ν)-1/f(ν)] ≤χfc(G) ≤min[d(υ)/f(υ)].  相似文献   

2.
3.
Let A be the space of functions analytic in the unit disk D = {z:|z| 1}.Let U denote the set of all functions f ∈ A satisfying the conditions f(0) = f'(0)-1 = 0 and|f'(z)(z/f(z))~2-1|1(|z|1).Also,let Ω denote the set of all functions f ∈ A satisfying the conditions f(0) = f'(0)-1 = 0and|zf'(z)-f(z)|1/2(|z|1).In this article,we discuss the properties of U and Ω.  相似文献   

4.
5.
Let f be an analytic function in a convex domain D?C. A well-known theorem of Ozaki states that if f is analytic in D, and is given by f(z)=zp+n=p+1anzn for zD, and
Re{eiαf(p)(z)}>0,(zD),
for some real α, then f is at most p-valent in D. Ozaki's condition is a generalization of the well-known Noshiro–Warschawski univalence condition. The purpose of this paper is to provide some related sufficient conditions for functions analytic in the unit disk D={zC:|z|<1} to be p-valent in D, and to give an improvement to Ozaki's sufficient condition for p-valence when zD.  相似文献   

6.
7.
This paper deals with interpolating sequences (zn)n for two spaces of holomorphic functions f in the unit disk D in C: those that are bounded and those that satisfy a Lipschitz condition |f(z)?f(w)|c|z?w|α, 0<α1. Given a sequence of values (wn)n in a certain target space, we look for a function f interpolating ‘in mean”, that is, with (f(z1)+?+f(zn))n=wn, n1. We obtain target spaces when we prescribe that the corresponding interpolating sequences be the uniformly separated ones or the union of two uniformly separated ones.  相似文献   

8.
9.
For Toeplitz operators Tf(t) acting on the weighted Fock space Ht2, we consider the semi-commutator Tf(t)Tg(t)?Tfg(t), where t>0 is a certain weight parameter that may be interpreted as Planck's constant ? in Rieffel's deformation quantization. In particular, we are interested in the semi-classical limit
(?)limt0?6Tf(t)Tg(t)?Tfg(t)6t.
It is well-known that 6Tf(t)Tg(t)?Tfg(t)6t tends to 0 under certain smoothness assumptions imposed on f and g. This result was recently extended to f,gBUC(Cn) by Bauer and Coburn. We now further generalize (?) to (not necessarily bounded) uniformly continuous functions and symbols in the algebra VMOL of bounded functions having vanishing mean oscillation on Cn. Our approach is based on the algebraic identity Tf(t)Tg(t)?Tfg(t)=?(Hf¯(t))?Hg(t), where Hg(t) denotes the Hankel operator corresponding to the symbol g, and norm estimates in terms of the (weighted) heat transform. As a consequence, only f (or likewise only g) has to be contained in one of the above classes for (?) to vanish. For g we only have to impose limsupt06Hg(t)6t<, e.g. gL(Cn). We prove that the set of all symbols fL(Cn) with the property that limt0?6Tf(t)Tg(t)?Tfg(t)6t=limt0?6Tg(t)Tf(t)?Tgf(t)6t=0 for all gL(Cn) coincides with VMOL. Additionally, we show that limt0?6Tf(t)6t=6f6 holds for all fL(Cn). Finally, we present new examples, including bounded smooth functions, where (?) does not vanish.  相似文献   

10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
An r-dynamic k-coloring of a graph G is a proper k-coloring such that for any vertex v, there are at least min{r,degG(v)} distinct colors in NG(v). The r-dynamic chromatic numberχrd(G) of a graph G is the least k such that there exists an r-dynamic k-coloring of G. The listr-dynamic chromatic number of a graph G is denoted by chrd(G).Recently, Loeb et al. (0000) showed that the list 3-dynamic chromatic number of a planar graph is at most 10. And Cheng et al. (0000) studied the maximum average condition to have χ3d(G)4,5, or 6. On the other hand, Song et al. (2016) showed that if G is planar with girth at least 6, then χrd(G)r+5 for any r3.In this paper, we study list 3-dynamic coloring in terms of maximum average degree. We show that ch3d(G)6 if mad(G)<187, ch3d(G)7 if mad(G)<145, and ch3d(G)8 if mad(G)<3. All of the bounds are tight.  相似文献   

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

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