基本释义:

笛卡尔图

网络释义

1)Cartesian diagram,笛卡尔图

2)Cartesian product graph,笛卡尔积图

3)Cartesian product,笛卡尔积图

4)Cartesian product graph,笛卡尔乘积图

5)Cartesian product of graphs,图的笛卡尔积

6)Descartes ray,笛卡尔线

用法和例句

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.

证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。

We study the star-edge coloring of Cartesian product graphs of some special classes of graphs, obtain the chromatic index ofP_m口P_n、P_m口C_n、P_m口S_n、P_m口F_n、P_m口W_n.

研究了若干笛卡尔积图的星边染色,并分别得到了P_m口P_n、P_m口C_n、P_m口S_n、P_m口F_n、P_m口W_n的星边色数;2。

A complete characterization for the(2,1)-total labelling numbers of the Cartesian product of two cycles and the Cartesian product of two paths was given.

刻画了圈与圈、路与路笛卡尔积图的(2,1)-全标号数。

Isoperimetric number of a kind of Cartesian product graph;

一类笛卡尔乘积图的等周数

The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product of graphs and the strong direct product of graphs.

本文所讨论的积图是图的笛卡尔积，图的张量积，图的逻辑积和图的强直积四种积图。

Descartes ray and character of round-section fibers;

圆形截面纤维的笛卡尔线及特征

Later, the angle decreases again, the ray of the maximal included angle position is called the Descartes ray.

一束平行光线垂直于圆柱形纤维轴照射,光线进入纤维经过两次折射和一次内表面反射后出射,入射光线偏离轴光线愈远(通过纤维截面中心沿原路反射回来的光线称为轴光线),它经过纤维出射的光线相对于入射光方向的夹角就愈大,达到某一位置时夹角达到了最大值,之后夹角又开始减小,这一最大夹角位置的光线称为圆柱形纤维的笛卡尔线。

But skin-core structure and the Descartes ray of internal surface reflection haven’t been involved.

目前对单根纤维的反光性能研究较少,主要涉及了表面反射光、透射光、内表面反射光这些方面,对纤维的皮芯层结构、其内表面反射光的笛卡尔线现象等没有涉及。

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

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

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

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

Adjacent Vertex-distinguishing E-total Coloring on Product of Graphs of Some Graphs

若干笛卡尔积图的邻点可区别E-全染色

Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs.

大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。

ON INCIDENCE CHROMATIC NUMBER OF P_N×K_M AND K(n,m);

路与完全图的笛卡尔积图和广义图K(n,m)的关联色数

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

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

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

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

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-限制边连通性

Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs

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

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

无限图的笛卡尔积的哈密顿性和连通性

On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths

路的笛卡尔乘积图的邻点可区别全染色

The Crossing Number of Cartesian Product of P_n with Circulant Graph C(10,2)

循环图C(10,2)与路P_n的笛卡尔积的交叉数

Decycling Number of Cartesian product of Complete Graph and Tree,Cycle,Complete Graph,Complete Bipartitle Graph

完全图与树、圈、完全图、完全二部图的笛卡尔乘积图的消圈数

The Quantitative Expression of Cartographic Features and the Model of Cartesian Products for Maps

地图要素的定量表示与地图笛卡尔积模型的探讨

The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs

一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题

On the Crossing Numbers of the Cartesian Products of Circular Graph and Some Special Graphs with Paths、Stars、Trees and Cycles

关于循环图及一些特殊图与路、星、树和圈的笛卡尔积的交叉数研究