一个关于图是分数(k,n)-临界的邻域并条件

设G是一个图,以及k是满足1≤k的整数.一个图G在删除任意n个顶点后的子图均含有分数k-因子,则称G是一个分数(k,n)-临界图.给出了图是一个分数(k,n)-临界图的一个邻域并条件,并且该条件是最佳的.     

奇图的匹配可扩性

设G是一个图,n,k和d是三个非负整数,满足n+2k+d≤|V(G)|-2,|V(G)|和n+d有相同的奇偶性.如果删去G中任意n个点后所得的图有k-匹配,并且任一k-匹配都可以扩充为一个亏d-匹配,那么称G是一个(n,k,d)-图.Liu和Yu[1]首先引入了(n,k,d)-图的概念,并且给出了(n,k,d)-图的一个刻划和若干性质. (0,k,1)-图也称为几乎k-可扩图.在本文中,作者改进了(n,k,d)-图的刻划,并给出了几乎k-可扩图和几乎k-可扩二部图的刻划,进而研究了几乎k-可扩图与n-因子临界图之间的关系.     

偶数阶W(4,n)的κ-边优美的图标号

设k是一个非负整数,G是一个p点q边图.如果将G的边用k,k+1,k+2,…,k+q-1进行标号,而顶点标号模p运算后各不相同,那么称图G是后一边优美的.记EGI(G)是所有满足G是k-边优美的k的集合,称EGI(G)是G的边优美指标集.主要是研究n为偶数时W(4,n)的边优美指标集.     

关于图是(g,f,n)-临界图的充分条件

设G是一个图. 设g和f是两个定义在V(G)上的整值函数使得对V(G)所有的顶点x有g(x)f(x). 图G被称为(g,f,n)-临界图,如果删去G的任意n个顶点后的子图都含有G的(g,f)-因子. 本文给出了图是(a,b,n)-临界图几个充分条件. 进一步指出这些条件是最佳的. 例如,如果对V(G)所有的顶点x和y都有g(x)＜f(x), n+g(x)dG(x)和g(x)/(dG(x)-n)f(y)/dG(y),则G是(g,f,n)-临界图.     

Hamiltonian[k,k+1]-因子

本文考虑n/2-临界图中Hamiltonian[k,k+1]-因子的存在性。Hamiltonian[k,k+1]-因子是指包含Hamiltonian圈的[k,k+1]-因子;给定阶数为n的简单图G,若δ(G)≥n/2而δ(G\e)相似文献   

关于图中子图的（n,k）—正交因子分解

设G是一个具有顶点集V(G)和边集E(G)的图. 设g和f是定义在V(G)上的两个整数值函数,使得g(x)f(x)对所有的点x∈V(G)都成立.如果G是一个(mg+n,mf-n)-图,1n<m2k,且g(x)2k-1对所有的点x∈V(G)都成立,则对任意给定具有|E(H)|=nk边的G的子图H,存在G的一个子图G′使G′有一个(g,f)-因子分解(n,k)-正交H.     

分数(g,f,m)-覆盖图的充要条件

G是一个图,g和f是两个定义在V(G)上的非负整数值函数,并且对任意的x∈V(G),满足g(x)≤f(x).称图G是分数(g,f,m)-覆盖图,如果存在图G的分数(g,f)-因子G[F_h]满足对任意的e∈E(H)有h(e)=1,其中H是图G的m条边的子图.证明了一个图是分数(g,f,m)-覆盖图的充要条件,并得到了几个推论.     

(n,k)-排列图的条件连通度(英文)

点连通度是衡量互联网络容错性的一个重要参数.尽管点连通度能正确地反映了系统的容错性能,但是不能正确反映大规模网络的健壮性能.条件连通度通过对各分支附加一些要求(当整个网络被破坏时)来克服这个缺点.给定一个基于图G的网络和一个正整数l,G的R~l-连通度,记为k~l(G),定义为图G的最小节点子集的节点数,使其去掉后,G是不连通的,且每个分支的最小度至少是l.在本文中,我们得到了(n,k)-排列图的条件连通度k~l(A(_n,k))=[(l+1)k-l](n-k)-l,其中k≥l+2,n≥k+l.     

图的联结数与分数κ-消去图

设G是一个图,若对于图G的任一条边e,G-e都存在一个分数k-因子,则称G是一个分数k-消去图.若k=2,则称分数k-消去图为分数2-消去图.本文证明了当bind（G）≥2,并且δ（G）≥3时,G是分数2-消去图.     

关于分数因子两个开问题的解答

本文指出极小连通二部分数1-因子不一定是极小2-连通图.研究了σ₂（G）与分数k-因子存在性之间的关系,指出存在一个特例在满足阶数n≥4k-5,δ（G）≥k且σ₂（G）≥n条件下,图G不存在分数k-因子.     

A Toughness Condition for Fractional (k,m)-deleted Graphs Revisited

In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. obtains a toughness condition for a graph to be fractional (k, m)-deleted and presents an example to show the sharpness of the toughness bound. In this paper, we remark that the previous example does not work and inspired by this fact, we present a new toughness condition for fractional (k, m)-deleted graphs improving the existing one. Finally, we state an open problem.     

(2,q)阶分数差分方程的解

首次提出了一种分数阶差分,分数阶和分以及分数阶差分方程的定义,并给出(2,q)阶常系数分数阶差分方程的具体解法.     

分数(k,q)阶差分方程的解

本文首次提出了一种分数阶差分,分数阶和分以及分数阶差分方程的定义,并利用Z变换理论,给出(k,q)阶常系数分数阶差分方程的具体解法.     

一类图的哈密顿分类

通过研究图G与C_p的包装问题,对边数q≥C_(P-1)~2-3的简单图进行分类,得到了满足此条件的全部非哈密顿图,由此推广了Ore和Bondy提出的关于此类问题的结果.     

Solving nonlinear fractional partial differential equations using the homotopy analysis method

In this article, the homotopy analysis method is applied to solve nonlinear fractional partial differential equations. On the basis of the homotopy analysis method, a scheme is developed to obtain the approximate solution of the fractional KdV, K(2,2), Burgers, BBM‐Burgers, cubic Boussinesq, coupled KdV, and Boussinesq‐like B(m,n) equations with initial conditions, which are introduced by replacing some integer‐order time derivatives by fractional derivatives. The homotopy analysis method for partial differential equations of integer‐order is directly extended to derive explicit and numerical solutions of the fractional partial differential equations. The solutions of the studied models are calculated in the form of convergent series with easily computable components. The results of applying this procedure to the studied cases show the high accuracy and efficiency of the new technique. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Relative Projective Modules and Relative Injective Modules

Let R be a ring, and n and d fixed non-negative integers. An R-module M is called (n, d)-injective if Ext ^d+1 _R (P, M) = 0 for any n-presented R-module P. M is said to be (n, d)-projective if Ext¹ _R (M, N) = 0 for any (n, d)-injective R-module N. We use these concepts to characterize n-coherent rings and (n, d)-rings. Some known results are extended.     

二阶($F, \alpha,\rho, d,p$) 一致凸性与极小极大分式规划的对偶

In this paper,we introduce a class of generalized second order(F,α,ρ,d,p)-univex functions.Two types of second order dual models are considered for a minimax fractional programming problem and the duality results are established by using the assumptions on the functions involved.     

On (k,d)-colorings and fractional nowhere-zero flows

The concepts of (k, d)-coloring and the star chromatic number, studied by Vince, by Bondy and Hell, and by Zhu are shown to reflect the cographic instance of a wider concept, that of fractional nowhere-zero flows in regular matroids. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 155–161, 1998     

A derivative concept with respect to an arbitrary kernel and applications to fractional calculus

In this paper, we propose a new concept of derivative with respect to an arbitrary kernel function. Several properties related to this new operator, like inversion rules and integration by parts, are studied. In particular, we introduce the notion of conjugate kernels, which will be useful to guaranty that the proposed derivative operator admits a right inverse. The proposed concept includes as special cases Riemann‐Liouville fractional derivatives, Hadamard fractional derivatives, and many other fractional operators. Moreover, using our concept, new fractional operators involving certain special functions are introduced, and some of their properties are studied. Finally, an existence result for a boundary value problem involving the introduced derivative operator is proved.