We now derive, based on the above results, sufficient conditions for a Cartesian product network
我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络
In this paper, we study the crossing numbers of the cartesian product graph and complete tripartite graph.
本文研究某些简单图与路，星图的笛卡尔积图的交叉数和完全三部图的交叉数。
In this thesis, we study the edge difference set of cartesian product of two paths under the balanced binary mapping.
本论文研究在平衡映射下两条道路的直积图的边差集。
Generally speaking, calculating the crossing numbers of graphs is very difficult, there are only a few results in this area at present, and the majorities are some special Cartesian product graphs.
一般来说，计算图的交叉数是一个很难的问题，目前只有少数这方面的结果，其中大部分是一些特殊笛卡尔积图的交叉数。
In chapter two, we determine the crossing number of the cartesian product of five graphs on 6-vertex with path.
第二章：我们确定了6个7阶图与路的笛卡尔积图的交叉数；第三章：我们证明了4个五阶图与星图的笛卡尔积交叉数；第四章：我们求出了完全三部图K_(1，m，n)的交叉数。
Then we can give the generalized Hamming weight's expression for the cartesian product.
则可给出笛卡尔积码广义Hamming重量的表达式。
And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.
证明了一类r-正则r=κ'连通非完全图G的边坚韧度近似等于r/21+(1/│V│-1并且提供了估计一些特殊图类的笛卡儿积和Kronecker积的边坚韧度的公式。
The natural number set N and the cartesian product N×N.
自然数集N和笛卡尔积N×N。
Considering 0is descendible mapping, using character of descendible mapping and Cartesian product, one-dimensional self-mapping is extended to n -dimensional self-mapping.
考虑是可降映射，本文利用可降映射的特征及笛卡尔积运算，将一维自映射的情形向更为一般地一类n维自映射进行了推广。
Through the analysis of the second power Cartesian product of natural number set N——N×N and the thirdpower Cartesian product of natural number set N——N×N×N, obtains the conclusion that they all have the bijective relation to natural number set N, it means that the set N×N and the set N×N×N are all countably infinite.
通过对自然数集合N的二次笛卡尔积运算———N×N和三次笛卡尔积运算———N×N×N的详细分析，得出了它们与自然数集合N之间都存在双射关系结论，即集合N×N和集合N×N×N都是可数无穷的。
The resulting tuple stream contains one tuple for each combination of values in the Cartesian product of the input sequences.
结果元组流对每一个值与输入序列的笛卡儿乘积的组合包含一个元组。
In this paper, we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
Deduces the operational formula of the function between the third power Cartesian product of the natural number set N & N × N × N and N, and further researches into complex computation of countably infinite sets.
文中推导出了自然数集合N的三次笛卡尔积运算&N×N×N与自然数集合N之间的双射函数运算公式，对可数无穷集合的复杂计算作了进一步研究。
If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。
The1 = 1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.
表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。
In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
All the inverse image formed by those Borel functions under corresponding Lebesgue measurable sets generate a partition of the Cartesian product. Let Cartesian product of any n-1 spaces of pure strategies have finite positive Lebesgue measure.
这m个Borel函数在对应Lebesgue可测集下的逆像构成这n个纯策略空间的笛卡尔乘积的一个划分，并且每n-1个纯策略空间的笛卡尔乘积都具有有限正Lebesgue测度。
The binding number of Cartesian product of complete graphs and complete bipartite graphs
完全图与完全偶图的笛卡尔乘积的联结数
On Hamiltonian property and connectivity of the Cartesian product of infinite graphs
无限图的笛卡尔积的哈密顿性和连通性
The Connectivity of Directed Circulant Graphs The Hamiltonian Cycle of Cartesian Product of Directed Cycles
有向循环图的连通度有向圈卡氏积图的哈密尔顿圈