它的四种可能输入对应于笛卡尔图的四个点。
Its four possible inputs correspond to four points on a Cartesian graph.
本文研究一类笛卡尔积图的交叉数。
In this paper, we study the crossing Numbers of the cartesian product graph.
本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
This text regards adjacent matrix as the memory structure of graph, and points out how to realize Kruskal algorithm in the computer, and analyses its complexity.
本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。
In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
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.
大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
Much effort has been spent on investigating the crossing Numbers of complete graphs, complete bipartite graphs and cartesian products graphs.
图1：飞思卡尔mpx2300dt1压力传感器可以以侵入性应用中使用。
Figure 1: The Freescale MPX2300DT1 pressure sensor can be used in invasive applications.
图那大学（美国）和卡尔鲁普奇特大学（德国）博士。
Ph. D. , Tulane University, USA and Karl Ruprecht Universitt, Germany.
图那大学（美国）和卡尔鲁普奇特大学（德国）博士。
Ph. D. , Tulane University, USA and Karl Ruprecht Universitt, Germany.
应用推荐