说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 句库 -> k-消去图
1.
Some Research on the Factors of Graphs, (g,f)-k-deleted Graphs and (g,f)-k-covered Graphs;
关于图的因子、(g,f)-k-消去图和(g,f)-k-覆盖图的研究
2.
Metal Artifact Reduction in CT Using K-Mean Cluster Algorithm
基于K均值聚类算法的CT图像金属伪影去除
3.
Some Results on [k, k+1]-Factor of Graph;
关于图的[k,k+1]-因子的若干结果
4.
On Bipartite G-Designs (Where G has four vertices or less);
(m,n,k,1)偶图G—设计(K≤4)
5.
Round-robin Tournaments K_(2n)~(i) and k-edge Colouring of Edge Matrix K′_(2n);
循环赛图K_(2n)~(i)与边矩阵K′_(2n)的K-边着色
6.
Diophantine Equation Concerning Factorials sum from k=1 to n k!=q~m+a
与阶乘有关的丢番图方程sum from k=1 to n k!=q~m+a
7.
On L(h, K)-labellings of a Type of Cartesian Products of Graphs;
关于一类卡氏积图的L(h,k)-标号
8.
Existence and Bound on k-restricted Edge Connectivity of Graphs;
图的k-限制边连通度的存在性及上界
9.
The Upper Bound of the Order of Planar Graph with Given Degree and Diameter;
直径为k最大次为△的平面图阶的上界
10.
The K_(1,k~-)-factorization of complete bipartite graphs;
完全二部图的K_(1,k~-)因子分解
11.
Web Image Mining of K-NN Classification Algorithm Using Relevance Feedback;
相关反馈K-邻近分类Web图像数据挖掘
12.
The Degree Condition of k-vertices Deletable ID-factor-critical Graphs;
k点可删的ID-因子临界图的度条件
13.
Bounds of the Laplacian Spectrum of the K Cycle Graphs of Length 3;
圈长为3的k圈图laplacian矩阵谱的界
14.
Floating Price Game for Revenue Management Based on K Line Chart;
基于K线图的收益管理浮动价格博弈
15.
ON THE ADJACENT STRONG EDGE CHROMATIC NUMBER OF K(r,2);
图K( r,2 )的邻强边色数(英文)
16.
k- graceful properties of wheel and count;
齿轮图_n和L_n的k-优美性
17.
A NOTE OF THE ADJACENT VERTEX-DISTINGUISHING TOTAL CHROMATIC NUMBER OF k-CUBE GRAPH;
k-方体图邻点可区别全色数(英文)
18.
A Study on Strongly Harmonious Labelingsof K-Regular Graphs of Order 2K;
关于2K阶K正则图强协调性的研究