Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K_(7,n) when 7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u)≠ C(v) for any two different vertices u and v of V(G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by χ_(vt)~e(G) and is called the VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.     

On some colorings of a double graph

In this note, we present some results concerning the chromatic index, the total chromatic index, the adjacent vertex distinguishing chromatic index and the adjacent vertex distinguishing total chromatic index for double graphs. In particular, we study the double graphs of class 1 and of type 1.     

正线性算子对无穷区间上有界变差函数的点态逼近度

用ＢＶ［０，∞）表示在［０，∞）的每一有限子区间上为有界变差函数的函数构成的空间。用表示ＢＶ［０，∞）上的正线性算子，其中ｄｔＫｎ（ｘ，ｔ）是非负测度且，则有定理如果Ｌｎ（｜ｔ－ｘ｜β，ｘ）≤Ｃ（ｘ）／ｎｖ，，这里β＞０，ｖ≥１，Ｃ（ｘ）是一个与ｘ有关的常数，对ｆ∈ＢＶ［０，∞）和ｘ∈（０，∞）有这里作为应用，给出算子的逼近估计．     

On Overspill Principles and Axiom Schemes for Bounded Formulas

We study the theories I?_n, L?_n and overspill principles for ?_n formulas. We show that IE_n ? L?_n ? I?_n, but we do not know if I?_n L?_n. We introduce a new scheme, the growth scheme Crγ, and we prove that L?_n ? Cr?_n? I?_n. Also, we analyse the utility of bounded collection axioms for the study of the above theories. Mathematics Subject Classification: 03F30, 03H15.     

Elimination of bounds in optimization problems by transforming variables

The problem of minimizing a nonlinear objective function ofn variables, with continuous first and second partial derivatives, subject to nonnegativity constraints or upper and lower bounds on the variables is studied. The advisability of solving such a constrained optimization problem by making a suitable transformation of its variables in order to change the problem into one of unconstrained minimization is considered. A set of conditions which guarantees that every local minimum of the new unconstrained problem also satisfies the first-order necessary (Kuhn—Tucker) conditions for a local minimum of the original constrained problem is developed. It is shown that there are certain conditions under which the transformed objective function will maintain the convexity of the original objective function in a neighborhood of the solution. A modification of the method of transformations which moves away from extraneous stationary points is introduced and conditions under which the method generates a sequence of points which converges to the solution at a superlinear rate are given.     

Sparse <Emphasis Type="Italic">H</Emphasis>-Colourable Graphs of Bounded Maximum Degree

Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5k¹³ such that G admits a surjective homomorphism c to F, and moreover, for any F-pointed graph H with at most k vertices, and for any homomorphism h from G to H there is a unique homomorphism f from F to H such that h=fc. As a consequence, we prove that if H is a projective graph of order k, then for any finite family of prescribed mappings from a set X to V(H) (with ||=t), there is a graph G of arbitrary large girth and of maximum degree at most 5k^26mt (where m=|X|) such that and up to an automorphism of H, there are exactly t homomorphisms from G to H, each of which is an extension of an f.Supported in part by the National Science Council under grant NSC89-2115-M-110-012Final version received: June 9, 2003     

多圆柱上的完全准凸映射

在C~n中有界凸Reinhardt域上讨论了一类介于凸映射类与星形映射类之间的“完全准凸映射类”.特别地,在C~n中的多圆柱上给出了完全准凸映射的分解定理,得到了多圆柱上判别凸映射的一个改进的充分条件.     

Degree of approximation to function of bounded variation by Bézier variant of MKZ operators

Guo (Approx. Theory Appl. 4 (1988) 9-18) introduced the integral modification of Meyer-Konig and Zeller operators and studied the rate of convergence for functions of bounded variation. In this paper we introduce the Bézier variant of these integrated MKZ operators and study the rate of convergence by means of the decomposition technique of functions of bounded variation together with some results of probability theory and the exact bound of MKZ basis functions. Recently, Zeng (J. Math. Anal. Appl. 219 (1998) 364-376) claimed to improve the results of Guo and Gupta (Approx. Theory Appl. 11 (1995) 106-107), but there is a major mistake in the paper of Zeng. For special case our main theorem gives the correct estimate on the rate of convergence, over the result of Zeng.