期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
简单无向图的压缩存储及格式转换算法
1
作者 刘治国 《信息技术》 2013年第11期88-91,共4页
对于图的同构判定问题、Ramsey理论、计算Folkman数等图论的研究方向,研究人员通常需要用计算机程序生成并处理大量的简单无向图。为了节省内存和外存空间、提高程序运行速度,应该对图进行压缩存储。文中对目前研究中广泛采用的简单无向... 对于图的同构判定问题、Ramsey理论、计算Folkman数等图论的研究方向,研究人员通常需要用计算机程序生成并处理大量的简单无向图。为了节省内存和外存空间、提高程序运行速度,应该对图进行压缩存储。文中对目前研究中广泛采用的简单无向图graph6存储格式进行了介绍,并给出了将图的邻接表存储格式转换为graph6存储格式的程序片段。 展开更多
关键词 简单无向图 压缩存储 graph6 图存储格式的转换
下载PDF
AN SIRS EPIDEMIC MODEL 被引量:2
2
作者 ChenJunjie 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第1期101-108,共8页
This paper considers an SIRS epidemic model that incorporates constant immigrati on rate, a general population size dependent contact rate and proportional tran sfer rate from the infective class to susceptible class... This paper considers an SIRS epidemic model that incorporates constant immigrati on rate, a general population size dependent contact rate and proportional tran sfer rate from the infective class to susceptible class.A threshold parameter σ is identified. If σ≤1, the disease free equilibrium is globally stab le. If σ>1, a unique endemic equilibrium is locally asymptotically stable. For two important special cases of mass action incidence and standard incidence, global stability of the endemic equilibrium is proved provided the threshold is larger than unity. Some previous results are extended and improved. 展开更多
关键词 epidemic model threshold endemic equilibrium global stability. ON 3 CHOOSABILITY OF PLANE GRAPHS WITHOUT 6 7 AND 9 CYCLES$$$$ Zhang Haihui 1 2 Xu Baogang 11School of Math. and Comput. Sci. Nanjing Normal Univ. Nanji ng 21009
下载PDF
A Result on Fractional(a,b,k)-critical Covered Graphs 被引量:3
3
作者 Si-zhong ZHOU 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2021年第4期657-664,共8页
A fractional[a,b]-factor of a graph G is a function h from E(G)to[0,1]satisfying a≤d^(h)_(G)(v)≤b for every vertex v of G,where d^(h)_(G)(v)=∑e∈E(v)h(e)and E(v)={e=uv:u∈V(G)}.A graph G is called fractional[a,b]-c... A fractional[a,b]-factor of a graph G is a function h from E(G)to[0,1]satisfying a≤d^(h)_(G)(v)≤b for every vertex v of G,where d^(h)_(G)(v)=∑e∈E(v)h(e)and E(v)={e=uv:u∈V(G)}.A graph G is called fractional[a,b]-covered if G contains a fractional[a,b]-factor h with h(e)=1 for any edge e of G.A graph G is called fractional(a,b,k)-critical covered if G—Q is fractional[a,b]-covered for any Q⊆V(G)with∣Q∣=k.In this article,we demonstrate a neighborhood condition for a graph to be fractional(a,b,k)-critical covered.Furthermore,we claim that the result is sharp. 展开更多
关键词 GRAPH NEIGHBORHOOD fractional[a 6]-factor fractional[a.6]-covered graph fractional(a.b k)-critical covered graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部