New Analytical and Numerical Results For Fractional Bogoyavlensky-Konopelchenko Equation Arising in Fluid Dynamics

In this article,(2+1)-dimensional time fractional Bogoyavlensky-Konopelchenko(BK)equation is studied,which describes the interaction of wave propagating along the x axis and y axis.To acquire the exact solutions of BK equation we employed sub equation method that is predicated on Riccati equation,and for numerical solutions the residual power series method is implemented.Some graphical results that compares the numerical and analytical solutions are given for di erent values of.Also comparative table for the obtained solutions is presented.     

Pretreating near infrared spectra with fractional order Savitzky–Golay differentiation(FOSGD)

With the aid of Riemann–Liouville fractional calculus theory,fractional order Savitzky–Golay differentiation(FOSGD) is calculated and applied to pretreat near infrared(NIR) spectra in order to improve the performance of multivariate calibrations.Similar to integral order Savitzky–Golay differentiation(IOSGD),FOSGD is obtained by fitting a spectral curve in a moving window with a polynomial function to estimate its coefficients and then carrying out the weighted average of the spectral curve in the window with the coefficients.Three NIR datasets including diesel,wheat and corn datasets were utilized to test this method.The results showed that FOSGD,which is easy to compute,is a general method to obtain Savitzky–Golay smoothing,fractional order and integral order differentiations.Fractional order differentiation computation to the NIR spectra often improves the performance of the PLS model with smaller RMSECV and RMSEP than integral order ones,especially for physical properties of interest,such as density,cetane number and hardness.     

图的反符号边k-控制数

图的符号边控制数有着许多重要的应用背景.已知它的计算是NP-完全问题,因而确定其精确值有重要意义.本文给出了一般图的反符号边k-控制数的若干上界.     

关于图的两类符号控制数的下界

通过对集合分组的方法,给出了图的结构性质.从而得到了符号控制数和强符号全控制数的6个下界,且这6个下界是最好可能的.     

Domination number in graphs with minimum degree two

A set D of vertices of a graph G = （V, E） is called a dominating set if every vertex of V not in D is adjacent to a vertex of D. In 1996, Reed proved that every graph of order n with minimum degree at least 3 has a dominating set of cardinality at most 3n/8. In this paper we generalize Reed＇s result. We show that every graph G of order n with minimum degree at least 2 has a dominating set of cardinality at most （3n ＋IV21）/8, where V2 denotes the set of vertices of degree 2 in G. As an application of the above result, we show that for k ≥ 1, the k-restricted domination number rk （G, γ） ≤ （3n＋5k）/8 for all graphs of order n with minimum degree at least 3.     

Approximate Controllability of Neutral Functional Differential Systems with State-Dependent Delay

This paper deals with the approximate controllability of semilinear neutral functional differential systems with state-dependent delay. The fractional power theory and α-norm are used to discuss the problem so that the obtained results can apply to the systems involving derivatives of spatial variables. By methods of functional analysis and semigroup theory, sufficient conditions of approximate controllability are formulated and proved. Finally, an example is provided to illustrate the applications of the obtained results.     

特殊图类的符号控制数

图G的符号控制数γS(G)有着许多重要的应用背景.已知它的计算是NP-完全问题,因而确定其上下界有重要意义.本文研究了1)一般图G的符号控制数,给出了一个新的下界;2)确定了Cn图的符号控制数的精确值.     

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

给定一个图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成立。     

直径为d的超环面网的(d,2n)-控制数

n维超环面网C(dl,d2,…,dn)定义如下顶点集为{(x1,..,xn)|0≤xi<di(1≤i≤n)};每个顶点(xl,…,xn)与(x1±1,x2,…,xn),(xl,x2±1,…,xn),…,(x1,x2,….,xn±1)这2n个顶点相邻.(d,m)-控制数是用来刻画互连网络数据传输某种模式的一个新参数.本文证明了当d=diam(C(d1,d2,…,dn))时,n维超环面网C(d1,d2,…,dn)≠C(3,3,….,3)的(d,2n)控制数为2(n≥3,di≥3,i∈{1,2,…,n}.