该词条未找到_海词词典

您要查找的是不是：

In this paper ,we study the crossing numbers of the cartesian product graph. 本文研究一类笛卡尔积图的交叉数。
Let G be the Cartesian product graph of paths or cycles, and let t(G) denote the number of spanning trees in ?G?. 设 G是路或圈的笛卡尔乘积图 ;t( G)表示 G的支撑树数 .
Isoperimetric number of a kind of Cartesian product graph 一类笛卡尔乘积图的等周数
In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture. 第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。
Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs. 大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
Embedding Cartesian Product Graphs into Cayley Graphs 迪卡尔乘积图到Cayley图中的嵌入
Cartesian product graph 笛卡尔积图
Some attributes for the mubtiple cartesian product graph of complete bigraph and circuits, A theorem for the binding number of multiple cartesian product graph of complete bigraph and circuits were presented and proven in this paper 本文给出并证明了完全偶图与多个圈的多重笛卡儿乘积图的一些性质及其联结数的一个计算公式。
ON INCIDENCE CHROMATIC NUMBER OF THREE CLASSES OF CARTESIAN PRODUCT GRAPHS 三类笛卡尔积图的关联色数
On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths 路的笛卡尔乘积图的邻点可区别全染色
The Numbers of Spanning Trees in the Cartesian Product Graphs of Paths or Cycles 路或圈的笛卡尔乘积图的支撑树数
It is the Cartesian product between the specified tables. 它是指定表的笛卡尔积。
A cross join is also called a cross product or Cartesian product. 交叉连接也称作矢量积或笛卡儿积。
The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs 完全多部图和笛卡儿积图的线性点荫度
Cross joins are also called Cartesian products. 交叉联接也称作笛卡尔积。
A join is a Cartesian product of two row sets, with the join predicate applied as a filter to the result. 一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。
The two FOR loops generate a Cartesian product from which the product name and the individual feature are returned. 两个FOR循环将生成笛卡儿积,将从该积返回产品名称和单个功能。
In chapter two ,we determine the crossing number of the cartesian product of five graphs on 6-vertex with path. 在第二章，我们确定了5个六阶图与路P_n的笛卡尔交叉数；
This paper discusses the upper chromatic number of the Cartesian product of co-hypergraphs. 讨论反超图的笛卡儿积的着色理论,求出了满足一定条件的反超图的笛卡儿积的上色数。
The size of a Cartesian product result set is the number of rows in the first table multiplied by the number of rows in the second table. 第一个表的行数乘以第二个表的行数等于笛卡尔积结果集的大小。