弱罗马控制数与最小控制数相同的树

Henning M A等提出了图的弱罗马控制数(记为γ_r(G))的概念,给出了弱罗马控制数与最小控制数相同的图(即γ(G)=γ_r(G))的特征.树是无圈的连通图,相同条件下它除了满足上述的特征外,还具有自身的特点.运用递归法和指标函数法,刻画了弱罗马控制数与最小控制数相同的树(即γ(T)=γ_r(T))的特征.     

九树十行问题的完全解答

九树十行问题的完全解答齐齐哈尔教育学院刘毅本文约定把满足“九树十行问题：把九棵树栽成十行，使每行信有三棵”的图形叫做构图，其中通过各个点（称树为点）的直线（称行为直线）的条数叫做该点的叉数．本文以构图表（类似［１］中的构形表）为工具．讨论构图的必要条...     

图的局部减边控制数

引入局部减边控制函数和局部减边控制数的概念,得到了图的最小局部减边控制函数的性质,给出了局部减边控制数的最好上下界,确定了一些特殊图的局部减边控制数.最后得到了图的减边控制数的最好上界.     

有关图的弱罗马控制数的一些结论

图的弱罗马控制数是图的弱罗马控制函数(简称WRDF)的最小权,记为γr(G).本文确定了完全n部图的弱罗马控制数,根据罗马控制数的下界以及弱罗马控制数与罗马控制数、控制数之间的关系,确定了弱罗马控制数的下界,运用概率方法给出了弱罗马控制数的上界.     

微分几何中的Rauch比较定理和model流形

本文通过构造一些model流形,利用Rauch比较定理,得到了: 1.证明了radial curvature≤0不是必要的; 2.我们通过对Jacobi field的长度作估计,以一个侧面时临界值r~(-2)作一点说明,得到了一些新的结果。     

Solutions to a Class of Differential—fuctional Equations

ＳｏｌｕｔｉｏｎｓｔｏａＣｌａｓｓｏｆＤｉｆｆｅｒｅｎｔｉａｌ－ｆｕｃｔｉｏｎａｌ　ＥｑｕａｔｉｏｎｓＬｉＺｅｍｉｎ（李泽民）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈｅｎｇｚｈｏｕＵｎｉｖｅｒｓｉｔｙ）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓｐａ...     

弹性函数的若干应用

列举了弹性函数在数学分析、经济分析和数值分析三个方面的应用.在数学分析方面利用弹性函数分别给出了函数超（次）加性和几何凸（凹）性的判别定理,在经济分析和数值分析方面利用弹性函数进行了简单的弹性分析和误差分析.     

弹性函数的若干应用

列举了弹性函数在数学分析、经济分析和数值分析三个方面的应用.在数学分析方面利用弹性函数分别给出了函数超(次)加性和几何凸(凹)性的判别定理,在经济分析和数值分析方面利用弹性函数进行了简单的弹性分析和误差分析.     

Eigenvalues of Spinc Dirac Operator

In this paper we research the lower bound of the eigenvalue of Spinc Dirac operator on the Spinc manifold. By the Weisenbock formula, we get an estimate of it, then following the idea of Th Friedrich [2] and X Zhang [6]. We get a finer estimate of it. As an application, we give a condition when the Seiberg-Witten equation only has 0 solution.     

关于典范体积形式的一个公式

本文给出了一个典范体积（Canonical volume)形式公式的代数证明。     

关于图的减控制与符号控制

给定一个图G=(V,E),一个函数f:V→{-1,0,1}被称为G的减控制函数,如果对任意v∈V(G)均有∑_μ∈N[v]f(μ)≥1。G的减控制数定义为γ^-(G)=min{∑_v∈Vf(v)|f是G的减控制函数}。图G的符号控制函数的正如减控制函数,差别是广{-1,0,1}换成{-1,1}。符号控制数γ_s(G)是类似的。本文获得γ^-G)和γ_s(G)的一些下界。同时也证明并推广了 Jean Dunbar等提出的一个猜想,即对任意 n阶 2部图 G,均有γ^-(G)≥ 4(n+1^1/2-1)-n成立。     

On Domination Number of 4-Regular Graphs

Let G be a simple graph. A subset S V is a dominating set of G, if for any vertex v V – S there exists a vertex u S such that uv E(G). The domination number, denoted by (G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then (G) ⁴/₁₁ n     

完全二部图的符号星控制数

近年来,研究图的符号星控制数颇引人注目,研究了完全二部图的符号星控制数.     

On the Roman domination number of a graph

A Roman dominating function of a graph G is a labeling f:V(G)?{0,1,2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γ_R(G) of G is the minimum of ∑_v∈V(G)f(v) over such functions. A Roman dominating function of G of weight γ_R(G) is called a γ_R(G)-function. A Roman dominating function f:V?{0,1,2} can be represented by the ordered partition (V₀,V₁,V₂) of V, where V_i={v∈V∣f(v)=i}. Cockayne et al. [E.J. Cockayne, P.A. Dreyer, S.M. Hedetniemi, S.T. Hedetniemi, On Roman domination in graphs, Discrete Math. 278 (2004) 11-22] posed the following question: What can we say about the minimum and maximum values of |V₀|,|V₁|,|V₂| for a γ_R-function f=(V₀,V₁,V₂) of a graph G? In this paper we first show that for any connected graph G of order n≥3, , where γ(G) is the domination number of G. Also we prove that for any γ_R-function f=(V₀,V₁,V₂) of a connected graph G of order n≥3, , and .     

Some Notes on Signed Edge Domination in Graphs

The closed neighborhood N_G[e] of an edge e in a graph G is the set consisting of e and of all edges having an end-vertex in common with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If for each e ∈ E(G), then f is called a signed edge dominating function of G. The signed edge domination number γ_s^′(G) of G is defined as . Recently, Xu proved that γ_s^′(G) ≥ |V(G)| − |E(G)| for all graphs G without isolated vertices. In this paper we first characterize all simple connected graphs G for which γ_s^′(G) = |V(G)| − |E(G)|. This answers Problem 4.2 of [4]. Then we classify all simple connected graphs G with precisely k cycles and γ_s^′(G) = 1 − k, 2 − k. A. Khodkar: Research supported by a Faculty Research Grant, University of West Georgia. Send offprint requests to: Abdollah Khodkar.     

关于图的符号星控制数

设G=(V,E)是一个图,u∈V,则E(u)表示u点所关联的边集.一个函数f:E→{-1,1}如果满足■f(e)≥1对任意v∈V成立,则称f为图G的一个符号星控制函数,图G的符号星控制数定义为γ'_(ss)(G)=min{■f(e):f为图G的一个符号星控制函数}.给出了几类特殊图的符号星控制数,主要包含完全图,正则偶图和完全二部图.     

控制数与星独立数

本文，我们讨论星独立数、分数星独立数、分数控制数和控制数间的关系，利用规划理论给出了上述参数的一些性质。     

Signed Roman (Total) Domination Numbers of Complete Bipartite Graphs and Wheels

A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for any v ∈ V, where N [v] is the closed neighborhood and N(v) is the neighborhood of v, and(ii) every vertex v for which f(v) =-1 is adjacent to a vertex u for which f(u) = 2. The weight of a SRDF(res. STRDF) is the sum of its function values over all vertices.The signed(res. signed total) Roman domination number of G is the minimum weight among all signed(res. signed total) Roman dominating functions of G. In this paper,we compute the exact values of the signed(res. signed total) Roman domination numbers of complete bipartite graphs and wheels.     

The Roman <Emphasis Type="Italic">k</Emphasis>-domatic number of a graph

Let k be a positive integer. A Roman k-dominating function on a graph G is a labeling f: V (G) → {0, 1, 2} such that every vertex with label 0 has at least k neighbors with label 2. A set {f ₁, f ₂, …, f _d } of distinct Roman k-dominating functions on G with the property that Σ _i=1 ^d f _i (v) ≤ 2 for each v ∈ V (G), is called a Roman k-dominating family (of functions) on G. The maximum number of functions in a Roman k-dominating family on G is the Roman k-domatic number of G, denoted by d _kR (G). Note that the Roman 1-domatic number d _1R (G) is the usual Roman domatic number d _R (G). In this paper we initiate the study of the Roman k-domatic number in graphs and we present sharp bounds for d _kR (G). In addition, we determine the Roman k-domatic number of some graphs. Some of our results extend those given by Sheikholeslami and Volkmann in 2010 for the Roman domatic number.     

符号混合控制问题的某些NP-完全性结果

Let G =(V, E) be a simple graph with vertex set V and edge set E. A signed mixed dominating function of G is a function f:V∪E→ {-1, 1} such that ∑_(y∈N_m(x)∪{x})f(y)≥ 1for every element x∈V∪E, where N_m(x) is the set of elements of V∪E adjacent or incident to x. The weight of f is w(f) =∑_(x∈V∪E)f(x). The signed mixed domination problem is to find a minimum-weight signed mixed dominating function of a graph. In this paper we study the computational complexity of signed mixed domination problem. We prove that the signed mixed domination problem is NP-complete for bipartite graphs, chordal graphs, even for planar bipartite graphs.