助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   uniform graph 的翻译结果: 查询用时:0.071秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

uniform graph
相关语句
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     A Neighborhood Condition for Graphs to Be [a,b;m]-uniform Graph
     关于图是[a,b;m]-均匀图的一个邻域条件(英文)
短句来源
     Uniform Dimensions for the Graph Sets of the Fractional Brownian Motions
     分式Brown运动图集的一致维数
短句来源
     X Graph and Its Properties
     X图及其性质
短句来源
     Uniform Design and Its Application
     均匀设计及其应用
短句来源
查询“uniform graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  uniform graph
In this paper, we develop a tabu search procedure for solving the uniform graph partitioning problem.
      
For any integern≥2, a necessary and sufficient condition for a (finite, nonempty) set of positive integers to be the degree set of ann-degree uniform graph is given.
      
In particular, some simple sufficient conditions for a graph to be an [a, b]-uniform graph are obtained for a ≤ b.
      
In this paper a necessary and sufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of this condition are discussed.
      
A graph G is called a (g, f)-uniform graph if for each edge of G, there is a (g, f)-factor containing it and another (g, f)-factor excluding it.
      
更多          


The concept of uniform graphs is posed,sufficient and necessary conditions for a graph to be uniform are given and a kind of graphs is proved to be uniform.

提出对等图的概念,给出一个图是对等图的充要条件.证明一类图是对等图

The following result is proved:Letting 1≤ a≤b be integers and G be a Graph of order n such that n≥2(a+b)(a+b-1)+1b ,and assuming |N G(u)∪N G(v)|>an+1a+b for each pair of nonadjacent vertices u,v in G and the minimum degree at least a +1,then we obtain that G is an [a,b] —uniform graph.

证明了如下结论 :设 1≤a an + 1a +b,则G是 [a ,b]—对等图 .

The concepts of (g,f)-deleted,(g,f)-covered and (g,f)-uniform graphs are generalized.Some sufficient and necessary conditions for deleted graphs,covered graphs and uniform graphs are given,the graphs satisfy g(x)

设 G是一个图 ,g,f是定义在图 G的顶点集上的两个整数值函数 ,且g≤f.图 G的一个 ( g,f) -因子是 G的一个支撑子图 F,使对任意的 x∈V( F)有g( x)≤ d F( x)≤ f ( x) .文中推广了 ( g,f) -消去图、( g,f ) -覆盖图和 ( g,f) -均匀图的概念 ,给出了在 g

 
<< 更多相关文摘    
图标索引 相关查询

 


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

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社