1) disjoint union
不相交并
2) disjoint union
不相交并集
3) disjoint union of set
不相交并集族
4) algorithm for labeling graphs/disjoint union
图标号算法/不相交并
5) disjoint union
不交并
1.
This paper discusses the gracefulness of disjoint union of paths such as,proving them graceful when.
文章讨论了形如P2m∪P2m+t的两条路不交并图的优美性,用构造性的方法给出了当t=-1,1,2时的优美标号,并证明它们是优美的。
2.
The gracefulness of disjoint union of paths such as Pm∪P2m+t are discussed.
讨论了形如Pm∪P2m+t的两条路不交并图的优美性,用构造性的方法给出了当t=0,1,2时的优美标号,并证明它们是优美的。
3.
This paper discusses the gracefulness of 3C 4k∪C n which is the disjoint union of four circles, gives out a necessary condition for the 3C 4k∪C n to be a graceful graph, and gives the graceful labelings of 3C 4k∪C 4n+3,3C 4k∪C 4k+4,3C 8k∪C 8k-1.
讨论了 4个圈不交并图 3 C4 k∪ Cn 的优美性 ,给出了其为优美图的必要条件 ,并用构造性的方法给出了 3 C4 k∪ C4 k+3,3 C4 k∪ C4 k+4 ,3 C8k∪ C8k-1的优美标号 ,证明了它们是优美
6) disjoint
[英][dis'dʒɔint] [美][dɪs'dʒɔɪnt]
不相交
1.
This paper discusses the homogeneous embeddings of disjoint Steiner triple systems.
本文讨论了不相交Steiner三元系组{X,A_i)|1≤i≤n}的齐次嵌入问题,并完整地解决了n=3时,不相交Steiner三元系组的齐次嵌入。
2.
The algorithm will firstly put the multiple disjoint paths which have been found,into the path set Px and put the paths which are not disjoint from path set Px into the candidate path set Cx.
将寻找到的多条不相交路径添加到路径集Px中,将相交路径添加到备用路径集Cx中。
3.
Two pure idempotent Latin squares are strictly disjoint,if their 3-tuple sets are disjoint.
设S是v元集,拉丁方A=(a_(ij))是指S上的一个v阶方阵,使得S的每个元素在A的每一行和每一列中都恰好出现一次,当A满足:对任意i∈S,都有a_(ii)=i,且三元组集合{{i,j,a_(ij)}:i,j∈S且i,j,a_(ij)都不相同}含有v(v-1)个不同的元素时,称之为纯的幂等拉丁方,若两个纯幂等拉丁方的三元组集合是不相交的,则称之为严格不相交的。
补充资料：V形相交纹
V形相交纹 青铜器纹饰之一。以两“V”形相互交叉，作一颠一倒排列，尖角和四周饰以变云纹。盛行于战国时期。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条