排序方式: 共有14条查询结果,搜索用时 15 毫秒
1.
2.
1BasicDefinitionsandNotationsWedealwithfiniteundirectedgraphswhichmadhavemultipleedgesbuthavenoloops.LetGbeagraphwithvertexsetV(G)andedgesetE(G).ForeachxEV(G),wedenotethedegreeofzinGbydG(x).Letg,fbetwointeger-valuedfunctionsdefinedonV(G)suchthatg(x)5f(x)forallxEV(G).A(g,f)-factorofGisaspanningsubgraphFofGsuchthatg(x)SdF(x)5f(x)forallxEV(G),andwecallthatFisa(g,f)-factorOfG.Ifg(x)5dG(x)Sf(x)forallxEV(G),thenwecallthatGis(g,f)-graph.Inparticular,g(x)=a,f(x)=bforallxEV(G),thenwecal… 相似文献
3.
1 BasicDefinitionsandNotationsWeonlydealwithfiniteundirectedsimplegraphs.LetGbeagraphwithvertexsetV(G)andedgesetE(G) .Foreachx∈V(G) ,wedenotethedegreeofxinGbydG(x) .Letg ,fbetwointeger_valuedfunctionsdefinedonV(G)suchthatg(x)≤f(x)forallx∈V(G) .A (g ,f)_factorofGisas… 相似文献
4.
与任意图正交的[0,ki]1^m—因子分解 总被引:1,自引:0,他引:1
设G是一个图,k1,…,km,是正整数,若图G的边能分解成m个边不交的[0,k1]-因子 F1,…,[0,]-l因子Fm,则称F={F1,…,Fm}是G 的一个[0,ki]1^m-因子分解,如果H是G的一个有m条边的了了图且对任意的1≤i≤m有E(H)E(Fi)=1,则称F与H正交,证明了若G是一个[0,k1 ,…, km-m 1]-图,。H是G的一个有m条边的子图,则图G有一个[0,ki]1^m-因子分解与H正交。 相似文献
5.
RESEARCHANNOUNCEMENTSOn{P2,Ci|i3}coveredGraphsMaRunnian(马润年)(AirForceTelecommunicationEngineringInstitute,Xi’an,Shaanxi,710... 相似文献
6.
7.
设 G是一个图,若对于 G的任意一边 G都有{P_2,Ci|i->3}-因子含有这条边,则称G是{P_2,Ci|i->3}-覆盖图.本文给出连通非二分图G是{P2,Ci|i->3}-覆盖图的充要条件为任给S■V(G),V(G)≠S≠■有i(G-S)_>|S|-1成立. 相似文献
8.
9.
一类带有非线性传染率的SEIR传染病模型的全局分析 总被引:1,自引:0,他引:1
通过假设被传染的易感者一部分经过一段潜伏期后才具有传染性,而另一部分被感染的易感者直接成为传染者,建立了一类带有非线性传染率的SEIR传染病模型,得到了确定疾病是否成为地方病的基本再生数以及无病平衡点和地方病平衡点的全局稳定性. 相似文献
10.
Some sufficient criteria have been established to ensure the global exponential stability of delayed cellular neural networks by using an approach based on delay differential inequality.COmpared with the method of Lypunov functionals as in most previous studies,our method is simpler and more effective for a stability analysis of delayed system,Some previously established results in the literature are shown to be special casses of the present result. 相似文献