1) 3 total graphs
3-全图
2) complete tripartite graph
完全3分图
1.
A new class of uniformly best graphs in the complete tripartite graph;
完全3分图中一类新的一致最优图
3) complete tripartite graph
完全3-部图
1.
Crossing number of the complete tripartite graph K_(1,10,n);
完全3-部图K_(1，10，n)的交叉数
2.
In this papaer we prove that if Zarankiewicz s conjecture is true for the case m = 7, then the crossing number of the complete tripartite graph K1,6,n is 9 [n/2][n-1/2] + 6[n/2].
本文主要证明了若Zarankiewicz猜想对m=7成立,则完全3-部图K1,6,n的交叉数为9[n/2][n-1/2]+6[n/2]。
4) complete 3-partite graph
完全3部图
1.
For any normal integer,the graphs made by separately cohering the same path in equal length on the complete 3-partite graph K1,m,n,complete graph,the corona n of K3 and K4 and each vertex of K3 are all graceful graphs.
对任意正整数m和n,完全3部图K1,m,n,K3和K4的n—冠,以及K3的每个顶点分别粘接一条等长路所得图是优美图。
5) 3D integral image
3维全景图像
6) total graph
全图
1.
This paper discusses clique covering number and clique partition number on the line graph and total graph of n Sun graph.
主要讨论ｎ－太阳图的线图及全图的团覆盖数和团划分数，得出了ｎ－太阳图的线图及全图的覆团盖数与团划分数相等且都是ｎ的倍数。
2.
Using the method of graft transformation,this paper discussed the spectral radius of unicyclic graphs and their total graphs,meanwhile,the extreme graphs which reach the upper(lower)bounds were given respectively.
利用移接变形的方法研究单圈图及其全图的谱半径,给出这2类图的谱半径达到上下界的极图。
3.
Let \$G\$ be a simple graph,the transformation graph \$G~——\$ is the complements of the total graph of \$G.
G是一个简单图,变换图G---是G的全图的补图。
补充资料：全图
1.旧时线装本通俗小说，卷首有每回主要故事情节图画的，称"全图"。 2.犹宏图。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条