bicartesian square

用法例句

And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.

证明了一类r-正则r=κ′(G)连通非完全图G的边坚韧度近似等于r/2(1+(1/│V(G)│-1))并且提供了估计一些特殊图类的笛卡儿积和Kronecker积的边坚韧度的公式。

Product topology and box topology are two methods for introducing topologies in general Cartesian product,both of them are generalization of the concept of finite product topology.

积拓扑与箱拓扑是在拓扑空间族的笛卡儿积上引进的2种不同的拓扑,它们都是有限积拓扑的推广,对这2种拓扑作以比较是有益的。

This paper discusses the upper chromatic number of the Cartesian product of co-hypergraphs.

讨论反超图的笛卡儿积的着色理论 ,求出了满足一定条件的反超图的笛卡儿积的上色数 。

The method of Descartes′ construction for 7 and 8 degree equations;

七、八次方程的笛卡儿做图

Wittgensteiin:Breaker of Descartes Tradition;

突破笛卡儿式传统的维特根斯坦

Cogito :from Descartes to Sartre;

“我思”:从笛卡儿到萨特

A Popularize of Venn Diagraph in Cartesian Product

集合笛卡儿积集中文氏图的一种推广

The Geodetic Number of Cartesian Product on Cycles and Complete Graphs

关于圈与完全图的笛卡儿积的测地数

The Crossing Numbers of Cartesian Products of Paths with 6-Vertex Graphs

6-阶图与路的笛卡儿积交叉数(英文)

Degree Bounded Spanning Tree of Cartesian and Direct Product;

笛卡儿积图和直积图上的度限定支撑树

The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs

完全多部图和笛卡儿积图的线性点荫度

Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs

部分图笛卡儿积图的邻点可区别VE-全染色

Cartesian coordinate system

ph.1. 【数】笛卡儿坐标制

The Binding Number of cartesian product of circuit and comprete bipartite graph

圈与完全偶图的笛卡尔乘积的联结数

In this paper ,we study the crossing numbers of the cartesian product graph.

本文研究一类笛卡尔积图的交叉数。

On the Crossing Numbers of Cartesian Products of 5-vertices Graphs with Stars;

五阶图与星图的笛卡尔积图的交叉数

Crossing Number of Products of Several 6-Vertex Graphs with Star

几个六阶图与星S_n的笛卡尔积交叉数

On the Super 3-restricted Edge Connectivity of Cartesian Product of Graphs

笛卡尔乘积图的超级3-限制边连通性

Crossing Numbers of Cartesian Products of Stars with 5-vertex Graph

一个五阶图与星图的笛卡尔积交叉数

In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture.

第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。

"Which do you prefer, Descartes or Spinoza?"

“你喜欢笛卡儿还是斯宾诺莎？”

structured Cartesian coordinate programming

结构式笛卡儿坐标程序设计

Using Hermite Matrices over Finite Field to Construct Cartesian Authentication Code

利用厄米特矩阵构作的笛卡儿认证码

Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs

笛卡尔乘积图与直接乘积图的限制边连通性