 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   通讯频率 在 数学 分类中 的翻译结果: 查询用时：0.818秒 在分类学科中查询 所有学科 数学 电信技术 矿业工程 更多类别查询 历史查询  通讯频率 communication frequency(3)  communication frequency
 The L(2, l)-labeling Problem on Graphs and the Moving Communication Frequency Assignment Problem 图的L(2,1)标号与移动通讯频率分配问题 短句来源 An L (2,1) labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that ｜f(x)-f(y)｜2 if d(x,y) =1 and ｜f(x)-f(y)｜ 1 if d(x,y) =2.The moving communication frequency assignment problem can be transformed into an L(2,1) labeling problem on a graph. 图G的L(2 ,1 )标号是一个从顶点集V(G)到非负整数集的函数f(x) ,使得若d(x ,y) =1 ,则|f(x) -f(y) | 2 ; 若d(x ,y) =2 ,则 |f(x) -f(y) | 1 .移动通讯频率分配问题可以转化为图的L(2 ,1 )标号问题 . 短句来源 An L(2,1)-labeling of a graph G is a function,from the vertex set V(G)to theset of all nonnegative integers such that |f(x)-f(y)|≥2 if d(x,y)=1 and |f(x)-f(y)|≥1 if d(x,y)=2.The moving communication frequency assignment problem canbe transformed into an L(2,1)-labeling problem on a graph. 图G的L(2,1)标号是一个从顶点集V(G)到非负整数集的函数f(x),使得若d(x,y)=1,则|f(x)-f(y)|≥2; 若d(x,y)=2,则|f(x)-f(y)|≥1.移动通讯频率分配问题可以转化为图的L(2,1)标号问题. 短句来源 查询“通讯频率”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  communication frequency
 HF detecting radar and communication frequency selection system Most mothers reported having communicated with their home visitor about the three risk areas, but there were no differences in communication frequency based on whether services were needed. Acoustic analysis shows that the optimal communication frequency is inversely proportional to about the 0.4 power of the animal's body mass. For parallel programs, communication frequency, communication bandwidth and serialization complicate the situation further. In other words, the communication frequency is high amongst neighbors and high overheads are far less tolerable. 更多 An L (2,1) labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that ｜f(x)-f(y)｜2 if d(x,y) =1 and ｜f(x)-f(y)｜ 1 if d(x,y) =2.The moving communication frequency assignment problem can be transformed into an L(2,1) labeling problem on a graph.The 2 lattice and relative graph are extended to the n lattice and relative graph,and the L(2,1) labelings of the n lattice and relative graph are given. 图G的L(2 ,1 )标号是一个从顶点集V(G)到非负整数集的函数f(x) ,使得若d(x ,y) =1 ,则|f(x) -f(y) | 2 ;若d(x ,y) =2 ,则 |f(x) -f(y) | 1 .移动通讯频率分配问题可以转化为图的L(2 ,1 )标号问题 .将 2 格图及相关图推广到n 格图及相关图 ,并给出了它们的L(2 ,1 )标号 . An L(2,1)-labeling of a graph G is a function,from the vertex set V(G)to theset of all nonnegative integers such that |f(x)-f(y)|≥2 if d(x,y)=1 and |f(x)-f(y)|≥1 if d(x,y)=2.The moving communication frequency assignment problem canbe transformed into an L(2,1)-labeling problem on a graph.In this paper we firstlygive an L(2,1)-labeling of a plane lattice graph,and then get an L(2,1)-face labelingof a plane near regular hexagon subdivision graph by the L(2,1)-labeling of the planelattice and relative graphs,so... An L(2,1)-labeling of a graph G is a function,from the vertex set V(G)to theset of all nonnegative integers such that |f(x)-f(y)|≥2 if d(x,y)=1 and |f(x)-f(y)|≥1 if d(x,y)=2.The moving communication frequency assignment problem canbe transformed into an L(2,1)-labeling problem on a graph.In this paper we firstlygive an L(2,1)-labeling of a plane lattice graph,and then get an L(2,1)-face labelingof a plane near regular hexagon subdivision graph by the L(2,1)-labeling of the planelattice and relative graphs,so we completely solve the moving communication frequencyassignment problem. 图G的L(2,1)标号是一个从顶点集V(G)到非负整数集的函数f(x),使得若d(x,y)=1,则|f(x)-f(y)|≥2;若d(x,y)=2,则|f(x)-f(y)|≥1.移动通讯频率分配问题可以转化为图的L(2,1)标号问题.本文首先给出平面格子图的L(2,1)标号,然后通过平面格子图及相关图的L(2,1)标号得到平面近正六边形剖分图的L(2,1)面标号,从而解决了移动通讯的频率分配问题. 相关查询

 CNKI小工具 在英文学术搜索中查有关通讯频率的内容 在知识搜索中查有关通讯频率的内容 在数字搜索中查有关通讯频率的内容 在概念知识元中查有关通讯频率的内容 在学术趋势中查有关通讯频率的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社