 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   graph is a 的翻译结果: 查询用时：0.188秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  graph is a 图是(27)  图是
 This paper has formulated a kind of nonconnected graph C 4∪K m,n ,and proved that the graph C 4∪K m,n is a k graceful graph when k>1(k∈N) ,and that the graph is a ( k,d )arithmetic graph when k>[(n-1)m+1]d+1(d>1 and m,n,d∈N) . 论证了当k>1 (k∈N)时 ,该图是k优美图 ; 当k >[(n - 1 )m +1 ]d +1 (d >1 ;m ,n ,d∈N)时 ,图C4∪Km ,n是 (k ,d)算术图。 短句来源 The present paper presents a kind of unconnected graph C 4∪ St (m) , proves that the graph C 4∪ St (m) is a k graceful graph, when k>1, and that the graph is a (k,d) arithmetic graph when k>d+1 and d>1(d∈N). 给出一类非连通图 C4∪ St（m ）． 论证当 k＞ 1（k∈ N ）时， 该图是 k 优美图； 当 k＞ d＋ 1（d ＞ 1， d ∈ N）时， 图 C4∪ St（m ）是（k，d ）算术图． 短句来源 Finding obstacle-avoiding shortest path is an important problem in VLSI design, and connection graph is a fundamental tool to resolve the problem. 在有障碍时求两点间的最短路径是VLSI设计、机器人设计等领域中的基本问题,连接图是研究此问题的基本工具. 短句来源 K-bridge graph is a graph composed of K internally-disjotint paths connecting two vertices A and B.Primitive index of primitive K-bridge graph is calculated. K-桥图是由连接A,B两点的K条内部不交路所组成的图. 短句来源 An integer distance graph is a graph G(Z,D) with the integer set Z as vertex set, in which an edge joining two vertices u and v if and only if u-v∈D , where D is a set of natural numbers. 整数距离图是这样一类图G(Z ,D) ,其中 ,V(G) =Z ,两点u ,v之间存在一条边 ,当且仅当u -v∈D ,这里D是由自然数组成的一个集合 . 短句来源 更多 “graph is a”译为未确定词的双语例句
 The calibration graph is A=0.0021C+0.0005, with the linear regression correlative coefficient is 0.9986 and the relative standard deviation (RSD) of 1.21%. 对氨基苯甲酸的回归方程A=0.0021C+0.0005,R=0.9986,标准偏差为1.21%。 适合于盐酸普鲁卡因注射液中对氨基苯甲酸的含量测定。 短句来源 The coefficient a_1(G) of one degree term of chromatic polynomial is studied. A sufficient condition that a connected graph is a planar graph is given. The structure of the graph Gis demonstrated if |a_1(G)|=6,7,8,9,10. 引进了G-粘接树、(n_1,n_2,…,n_h)-图等概念,讨论了色多项式一次项系数的意义,给出了判断一个圈是平面图的充分条件,指出了当|a_1(G)|=6,7,8,9,10时,图G所具有的结构。 短句来源 With the reaction being kept running for 8 minutes at room temperature,the determined range of copper is 0.005～0.18mg·L -1 and the regression equation of calibration graph is A=0.2793 c-0.006 with a correlation coefficient of 0.9988.The method is used to determine trace copper in type-water,wild sweet tea and momordica grosvenori,with satisfactory results. 在 1 9°C下反应 8min,测定的线性范围为 0 .0 0 5～ 0 .1 8mg/L铜 ( ) ,回归方程为 A=0 .2 793 c-0 .0 0 6,相关系数为 0 .9988.方法用于自来水、野生甜茶、罗汉果中铜的测定 ,结果满意 . 短句来源 We prove that ′(G)=n for a (n-2) regular graph of ordern,and ′(G)=n-1 for a (n-3) regular graph of order n6, for which complementary graph is a Hamilton cycle. 本文确定了对n阶 (n -2 ) 度正则图G , χ′(G) =n ; 当n 6时 ,对其补图为Hamilton圈的n阶 (n -3 ) 正则图G , χ′(G) =n -1。 短句来源 An integer distance graph is a graph G(D) with the set of all integers Z as vertex set and two adjacent vertices u, v∈Z if and only if |u-v|∈D, where the distance set D is a subset of positive integers. 整数距离图G(D)以全体整数为顶点集,顶点u,v相邻当且仅当|u-v|∈D,其中D是一个正整数集. 短句来源 更多 相似匹配句对
 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 INFERIOR GRAPH 下方图形 短句来源 Visualization of graph algorithm 基于MVC的图算法可视化的实现 短句来源 of G, the construction of the graph G is solved. 之并等,从而为上述型图的构作提了充分的条件. 短句来源 Spanning Circuis in Graph 图中的生成闭迹 短句来源 查询“graph is a”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  graph is a
 The conjecture of zero domination of 0-cyclic monotone graphs is proved (anr-cyclic graph is a cyclic monotone (s, t)-graph exactlyr minimal paths of which have cycles). A covering path in a directed graph is a path passing through all vertices and arcs of the graph, with each arc being traversed only in the direction of its orientation. A covering path in a directed graph is a path passing through all vertices and arcs of the graph, with each arc being traversed only in the direction of its orientation. A functional graph is a digraph describing the action of a function on a set. A generalized Halin graph is a 2-connected plane graph G such that removing all the edges of the boundary of the exterior face of G (the degrees of the vertices in the boundary of exterior face of G are all three) gives a tree. 更多 It is a combinatorial problem with great significance in practics to obtain the bandwidth of a graph. However, it has been shown that algorithmic determination of the bandwidth of a graph is an NP-complete problem even for a tree. So it is attractive to get thc bandwidths of some special, classes, of graphs.In 1976, Dewdney announced in a survery, that the bandwidth of the discrete tori Cm × Cn is an unsolved problem. In this paper, we has solved this problem, i.e., we obtain the following... It is a combinatorial problem with great significance in practics to obtain the bandwidth of a graph. However, it has been shown that algorithmic determination of the bandwidth of a graph is an NP-complete problem even for a tree. So it is attractive to get thc bandwidths of some special, classes, of graphs.In 1976, Dewdney announced in a survery, that the bandwidth of the discrete tori Cm × Cn is an unsolved problem. In this paper, we has solved this problem, i.e., we obtain the following results:Theorem 1. If m≠n and min(m, n)≥3, then the bandwidth of the discrete tori Cm×Cn is 2 min(m, n);Theorem 2. If n≥3, then the bandwidth of the discrete tori Cn×Cn is 2n-1, 求一个图(Graph)——或一个对称矩陣——的带宽(Band width)是一个很有实际意义的組合問題。已經証明,即使对于树形图(Tree)来說,确定它的带宽問題也属于NP—完全类。因此,求出一些特殊类型的图的带宽就更加引人注目。事实上,能够定出其带宽的图很少。除了一些很簡单的情形外,迄今已知的主要結果只有完全偶图K_(m:n)、n維方体Q_n、平面格子图P_m×P_n和柱面上的格子图C_m×P_n。Dewdney在1976年所作的关于图的带宽的一篇綜述报告中,提出了三个沒有解决的問题。其中一个是求环面上格子图C_m×C_n的带宽。本文解决了这个問題,我們得到下述結果: 定理1.当m≠n且min(m,n)≥3时,环面上格子图C_m×C_n的带宽为2min(m,n); 定理2.当n≥3时,环面上格子图C_n×C_n的带宽为2n—1. A complementary partitive graph is a bipartite graph G(V', V"; E) with disjoint vertex sets V', V", and an edge set E such that all edges are directed except only one edge, say j=[x, y], is undireeted, and the outgoing degrees are d+(x)=0, d+(y)=0 and d+(v)=1 for all v≠x, y. The following assertions can be easily proved: If G(v', V"; E) is a complementary partitive graph with undireeted edge j, then a pair of eomple mentary partitions P'(E) and P"(E) with respect to j can be constructed by... A complementary partitive graph is a bipartite graph G(V', V"; E) with disjoint vertex sets V', V", and an edge set E such that all edges are directed except only one edge, say j=[x, y], is undireeted, and the outgoing degrees are d+(x)=0, d+(y)=0 and d+(v)=1 for all v≠x, y. The following assertions can be easily proved: If G(v', V"; E) is a complementary partitive graph with undireeted edge j, then a pair of eomple mentary partitions P'(E) and P"(E) with respect to j can be constructed by the edges incident with each vertex of V' and eaeh vertex of V". Conversely, if Hk has a com-plementary partition with respect to j, then a complementary partitive graph can be constructed.By using the complementary partitive graph defined above. We can ease the proofs of theorems of complementary partitions established by W. K. Chen (1969, 1976) and give a simple criterion to determine whether or not a complementary partition is essen-tial as follows:Theorem A complementary partition is essential if and only if the corresponding com-plementary partitive graph is a connected graph. 本文定义了一种二分图,称之为互补划分图。利用此图容易证明有关互补划分的定理,并可得到一个判别是否是本性互补划分的较弱的条件。 Bond graph is a new and powerful tool of system simulation.It has provided a simple and convenient method for establishing a mathematic model of a dynamic system. A digital imitation is made by using a computer program and sending directly the bond graph model into computer without establishing a mathematic model by manual in advance. 键图是一种新的强有力的系统模拟工具。它为建立动力学系统的数学模型提供了方便而简明的方法。利用某种计算机程序,可直接把键图模型送入计算机进行数字仿真,无需事先由人工建立数学模型。 << 更多相关文摘 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社