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

图标索引 历史查询
 

边优美图
相关语句
  edge-graceful graph
     On the existence of weakly edge-graceful graph
     关于弱边优美图的存在性
短句来源
     In this paper, the weakly edge-graceful graph is defined, and some results are obtained.
     给出了弱边优美图的概念,指出了它的客观存在性及其与边优美图、非边优美图的关系.
短句来源
  edge-graceful
     On the existence of weakly edge-graceful graph
     关于弱边优美图的存在性
短句来源
     The main result is that if (m,n) = 1,then complete bipartite graph Km,n with odd order is edge-graceful iff mn + 1=0 (mod m+n)
     主要结果有:当(m,n)=1时,奇阶完全二部图K_(m,n)为边优美图的充要条件是m+n|mn+1.
短句来源
     In this paper, the weakly edge-graceful graph is defined, and some results are obtained.
     给出了弱边优美图的概念,指出了它的客观存在性及其与边优美图、非边优美图的关系.
短句来源
     A method to construct k-edge-graceful graph Cm × Cn is given out by recursion and the problem of what sets of natural numbers are the edge-graceful indices of graph Cm × Cn is completely dissolved.
     利用递归方法构造k-边优美图标号并给出详细证明,从而完全解决了Cm×Cn的边优美指标集问题.
短句来源
     The edge-gracefulness of complete bipartite graphs and its edge-moved graphs is studied in this paper. The main result is that if (m,n)=1,then complete bipartite graph K(m,n) with odd order is edge-graceful iff mn+1≡0 (mod m+n).
     研究了完全二部图及其局部边迁移图的边优美性.主要结果有:当(m,n)=1时,奇阶完全二部图K(m,n)为边优美图的充要条件是m+n|mn+1.
短句来源
  “边优美图”译为未确定词的双语例句
     In this paper,we give a necessary condition which isq(q+1)- p(p-1)=0(modp). On edge-gracefulness of graphs, we also give sufficient and necessary conditions of pt, mCn and (mCn Pn-l,t se are t=0 (mod2),mn = l(mod2)and(m + 1)(mod2).
     本文给出了(p,q)-图G为边优美图的必要条件是,并证明了Pt,mCn,,(mCn)UPn-1为边优美的充分必要条件分别是t=0(mod2,mn=1(mod2),(m+1)n=1(mod2)
短句来源
     The sufficient condition is given out which G = V,E is said to be k-edge-graceful graph. And by the especial property of regular graph,the necessary condition which the graph Cm × Cn is k-edge-graceful is discussed.
     首先给出了图G=V,E为k-边优美的充分条件,根据正则图的特殊性质,讨论了Cm×Cn为k-边优美图的必要条件.
短句来源
查询“边优美图”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  edge-graceful
Super-edge-graceful Labelings of Some Cubic Graphs
      
The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.
      
In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful.
      


In this paper,we give a necessary condition which isq(q+1)- p(p-1)=0(modp).On edge-gracefulness of graphs, we also give sufficient and necessary conditions of pt, mCn and (mCn Pn-l,t se are t=0 (mod2),mn = l(mod2)and(m + 1)(mod2).

本文给出了(p,q)-图G为边优美图的必要条件是,并证明了Pt,mCn,,(mCn)UPn-1为边优美的充分必要条件分别是t=0(mod2,mn=1(mod2),(m+1)n=1(mod2)

The edge-gracefulness of complete bipartite graphs and its edge-moved graphs is studied in this paper. The main result is that if (m,n)=1,then complete bipartite graph K(m,n) with odd order is edge-graceful iff mn+1≡0 (mod m+n).

研究了完全二部图及其局部边迁移图的边优美性.主要结果有:当(m,n)=1时,奇阶完全二部图K(m,n)为边优美图的充要条件是m+n|mn+1.

The edge-gracefulness of complete bipartite graphs and its edge-moved graphs is studied in this paper. The main result is that if (m,n) = 1,then complete bipartite graph Km,n with odd order is edge-graceful iff mn + 1=0 (mod m+n)

研究了完全二部图及其局部边迁移图的边优美性.主要结果有:当(m,n)=1时,奇阶完全二部图K_(m,n)为边优美图的充要条件是m+n|mn+1.

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

 


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

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