Signed star domatic number of a graph

Let G be a simple graph without isolated vertices with vertex set V(G) and edge set E(G). A function f:E(G)?{−1,1} is said to be a signed star dominating function on G if ∑_e∈E(v)f(e)≥1 for every vertex v of G, where E(v)={uv∈E(G)∣u∈N(v)}. A set {f₁,f₂,…,f_d} of signed star dominating functions on G with the property that for each e∈E(G), is called a signed star dominating family (of functions) on G. The maximum number of functions in a signed star dominating family on G is the signed star domatic number of G, denoted by d_SS(G).In this paper we study the properties of the signed star domatic number d_SS(G). In particular, we determine the signed domatic number of some classes of graphs.     

On the packing chromatic number of some lattices

For a positive integer k, a k-packing in a graph G is a subset A of vertices such that the distance between any two distinct vertices from A is more than k. The packing chromatic number of G is the smallest integer m such that the vertex set of G can be partitioned as V₁,V₂,…,V_m where V_i is an i-packing for each i. It is proved that the planar triangular lattice T and the three-dimensional integer lattice Z³ do not have finite packing chromatic numbers.     

On alternation numbers of links

We construct infinitely many hyperbolic links with x-distance far from the set of (possibly, splittable) alternating links in the concordance class of every link. A sensitive result is given for the concordance class of every (possibly, split) alternating link. Our proof uses an estimate of the τ-distance by an Alexander invariant and the topological imitation theory, both established earlier by the author.     

Crosscap numbers of pretzel knots

The crosscap number of a knot in the 3-sphere is defined as the minimal first Betti number of non-orientable surfaces bounded by the knot. In this paper, we determine the crosscap numbers of a large class of pretzel knots. The key ingredient to obtain the result is the algorithm of enumerating all essential surfaces for Montesinos knots developed by Hatcher and Oertel.     

Coincidences of projections and linear n-valued maps of tori

We prove that the Nielsen fixed point number N(φ) of an n-valued map φ:X?X of a compact connected triangulated orientable q-manifold without boundary is equal to the Nielsen coincidence number of the projections of the graph of φ, a subset of X×X, to the two factors. For certain q×q integer matrices A, there exist “linear” n-valued maps Φn,A,σ:Tq?Tq of q-tori that generalize the single-valued maps fA:Tq→Tq induced by the linear transformations TA:Rq→Rq defined by TA(v)=Av. By calculating the Nielsen coincidence number of the projections of its graph, we calculate N(Φn,A,σ) for a large class of linear n-valued maps.     

On the relations of graph parameters and its total parameters

In this paper we get some relations between α（G）, α＇（G）, β（G）, β＇（G） and αT（G）, βT（G）. And all bounds in these relations are best possible, where α（G）, α＇（G）,/3（G）, β（G）, αT（G） and βT（G） are the covering number, edge-covering number, independent number, edge-independent number （or matching number）, total covering number and total independent number, respectively.     

ADAPTIVE QUADRILATERAL AND HEXAHEDRAL FINITE ELEMENT METHODS WITH HANGING NODES AND CONVERGENCE ANALYSIS

In this paper we study the convergence of adaptive finite element methods for the gen- eral non-attine equivalent quadrilateral and hexahedral elements on 1-irregular meshes with hanging nodes. Based on several basic ingredients, such as quasi-orthogonality, estimator reduction and D6fler marking strategy, convergence of the adaptive finite element methods for the general second-order elliptic partial equations is proved. Our analysis is effective for all conforming Qm elements which covers both the two- and three-dimensional cases in a unified fashion.     

VARIABLE MESH FINITE DIFFERENCE METHOD FOR SELF-ADJOINT SINGULARLY PERTURBED TWO-POINT BOUNDARY VALUE PROBLEMS

A numerical method based on finite difference method with variable mesh is given for self-adjoint singularly perturbed two-point boundary value problems. To obtain parameter- uniform convergence, a variable mesh is constructed, which is dense in the boundary layer region and coarse in the outer region. The uniform convergence analysis of the method is discussed. The original problem is reduced to its normal form and the reduced problem is solved by finite difference method taking variable mesh. To support the efficiency of the method, several numerical examples have been considered.     

对于K2+Tm和完全图的Ramsey函数的渐近上界

本文研究了当n趋于无穷大时,关于K2+Tm和完全图Kn的Ramsey数的渐近上界,以及r(K2+Tm,Kn)和r(K1+Tm,Kn)的渐近关系.利用李雨生等人所给出的一个独立数的下界公式,给出了r(K4,Kn)和r(Kk-c,Kn)的渐近上下界,推广了李雨生等人所给出的r(K1+Tm,Kn)的下界.     

Novel methods on comparing grey numbers

Uncertain decision-making is an important branch of decision-making theory. It is crucial to describe uncertain information, which determine the decision-making is effective or not. This paper first presents a brief survey of the existing methods on denoting uncertain information, such as fuzzy mathematics, stochastic and interval methods, analyzes the merits and demerits of these methods. Then the paper proposes a novel method grey systems theory to describe uncertain information and gives the novel definition of grey number on the basis of probability distribution. Subsequently a novel probability method on comparing grey numbers, especially discrete grey numbers and interval grey numbers, is studied. When an interval grey number satisfied to continuous uniform distribution, it will be degenerated into an interval number. Finally three numerical examples are investigated to demonstrate the effectiveness of the present method.