1) Cartesian product graph
笛卡尔积图
1.
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。
2.
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。
2) Cartesian product
笛卡尔积图
1.
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)-全标号数。
3) Cartesian product graph
笛卡尔乘积图
1.
Isoperimetric number of a kind of Cartesian product graph;
一类笛卡尔乘积图的等周数
4) Cartesian product of graphs
图的笛卡尔积
1.
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.
本文所讨论的积图是图的笛卡尔积，图的张量积，图的逻辑积和图的强直积四种积图。
5) Cartesian product
笛卡尔积
1.
Crossing numbers of cartesian products of stars with 5-vertex graphs
五阶图与星图的笛卡尔积交叉数
2.
The relation between the Cartesian product and authentication codes is studied in this paper.
该文研究了笛卡尔积与认证码的关系,根据笛卡儿积的结构特点,提出了一种将认证符信息嵌入到编码规则的思想,从工程应用的角度实现了基于笛卡尔积的各阶欺骗概率相等的最优Cartesian认证码的构造,并给出了基于笛卡尔积和拉丁方的各阶欺骗概率相等的安全认证码的构造方案。
3.
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都是可数无穷的。
6) Cartesian products
笛卡尔积
1.
It is proved that the crossing number of Hn is Z(5,n)+n+n2], and the crossing number of Cartesian products of W4 and K1,n is Z(5,n)+2n+n2].
证明了Hn的交叉数为Z(5,n)+n+﹂2n],并在此基础上证明了轮W4与星K1,n的笛卡尔积的交叉数为Z(5,n)+2n+﹂2n]。
2.
LetG1×G2 be the cartesian products of G1 with G2,V(G1×G2)=V(G1)×V(G2),E(G1×G2)=｛(u1,u2)(v1,v2)｜u1=v1 and u2v2∈E(G2),or u2=v2 and u1v1∈E(G1)｝.
两个图G1和G2的笛卡尔积图G1×G2是这样一个图:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,u2)(v1,v2)|u1=v1且u2v2∈E(G2),或者u2=v2且u1v1∈E(G1)}。
3.
In this paper,we prove the crossing number of Cartesian products of W_5 with S_n is 6「n/2」「(n-1)/2」+2n+3「n/2」+3「n/2」(「x」denotes the maximum integer that is no more than x),also we abtain the crossing numbers of Cartesian products of some sungraph of W_5 with S_n.
目前,对于六阶图与星图笛卡尔积的交叉数知之甚少。
补充资料：图尔卡纳人
| 图尔卡纳人 Turkana 东非民族。主要分布在乌干达（又称特索人）、肯尼亚西北部和苏丹共和国东南部。属尼格罗人种苏丹类型，为尼罗特人南支之一。使用图尔卡纳语，属尼罗-撒哈拉语系沙里-尼罗语族。相信万物有灵。约在1700年前后由尼罗河上游迁入今居住地。系游牧民族，存在部落组织，但比较松散，酋长权力不大，一般以家族为活动单位。部落内部有两个军事性质的集团：一名“豹”、一名“石头”。每个男子从出生之日起就从属于集团。一般行父系继承制和一夫多妻制。经济比较落后，主要逐水草而居，以放牧骆驼、绵羊和山羊为主，少数人从事农业。此外，还有一些手工业，能制陶、制革、制造木石用品，打制刀、矛等金属工具。
|
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条