全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 double cyclic graph 的翻译结果: 查询用时：0.006秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 double cyclic graph 双圈图(2)
 双圈图
 2 . we study the tree graphs T_G of the double cyclic graph. 2.研究了双圈图的树图T_G的结构,并进而给出了树图T_G的谱半径的界: 短句来源 (3) let G be a double cyclic graph, the length of the two cycles being p and q, respectively, and t the number of the vertices which are both in the two cycles (the end points are excluded), then F(G) = p + q - t - 6. (3)设图G为双圈图,两个诱导圈的圈长分别为p和q,t为这两个圈公共部分的路上的顶点个数(不包括两个端点),则F(G)=p+q-t-6． 短句来源
 “double cyclic graph”译为未确定词的双语例句
 (3) If m = n +1, G is a double cyclic graph. (2)当m=n时，图G为单圈图，则F(G)=g-3，其中g为围长。 短句来源
 相似匹配句对
 On D-cyclic in Graph 关于图中的支配圈 短句来源 (3) If m = n +1, G is a double cyclic graph. (2)当m=n时，图G为单圈图，则F(G)=g-3，其中g为围长。 短句来源 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 2 . we study the tree graphs T_G of the double cyclic graph. 2.研究了双圈图的树图T_G的结构,并进而给出了树图T_G的谱半径的界: 短句来源 s-Regular Cyclic Coverings of Heawood Graph Heawood图的s-正则循环覆盖 短句来源

我想查看译文中含有：的双语例句
 没有找到相关例句
 Two classes of connected double cyclic graphs,An(p,q)and B_n(G_s~l,G_t~k,T_m),are investigated in this paper.The relationship between the largest eigenvalues and the girths,and low bounds of the smallest eigenvalues of the graphs are obtained.Moreover,extremal graphs with these bounds are characterized,respec- tively,and the upper bound on the spread of the graphs is presented. 讨论了双圈图的最大和最小特征值,给出了其最大特征值随圈上点的变化关系；讨论了双圈图的最小特征值的下界；当 n≥18时双圈图中最小特征值达到最小的极图为 S_n(3,3)．在此基础上给出了双圈图谱展的上界． By using the decomposition theorem and the local reductive elimination for the fill-in of graphs, the fill-in numbers of some special graphs, such as G1×G2, S(G), R(G) and double cyclic graphs were studied. And the following results were obtained: (1) F(Pm×Pn)≤(m - 2)(n - 2), where m≥2, n≥2; (2) if G is a 2-connected graph with m edges and n vertices, then F(S(G)) = m + F(G); (3) let G be a double cyclic graph, the length of the two cycles being p and q, respectively, and t the... By using the decomposition theorem and the local reductive elimination for the fill-in of graphs, the fill-in numbers of some special graphs, such as G1×G2, S(G), R(G) and double cyclic graphs were studied. And the following results were obtained: (1) F(Pm×Pn)≤(m - 2)(n - 2), where m≥2, n≥2; (2) if G is a 2-connected graph with m edges and n vertices, then F(S(G)) = m + F(G); (3) let G be a double cyclic graph, the length of the two cycles being p and q, respectively, and t the number of the vertices which are both in the two cycles (the end points are excluded), then F(G) = p + q - t - 6. 运用图的最优填充分解定理和局部最优填充定理,将一些特殊图类G1×G2,S(G), R(G)和双圈图分解为一些可求得最小填充数的图,得到如下结果:(1)F(Pm×Pn)≤(m- 2)(n-2),其中m≥2,n≥2;(2)若G是有m条边的n阶2-连通图,则F(S(G))=m+F(G); (3)设图G为双圈图,两个诱导圈的圈长分别为p和q,t为这两个圈公共部分的路上的顶点个数(不包括两个端点),则F(G)=p+q-t-6．
 相关查询

 CNKI小工具 在英文学术搜索中查有关double cyclic graph的内容 在知识搜索中查有关double cyclic graph的内容 在数字搜索中查有关double cyclic graph的内容 在概念知识元中查有关double cyclic graph的内容 在学术趋势中查有关double cyclic graph的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社