Firstly, some problems on factorizations in complete graphs are studied.
完全图的因子分解问题。
Moreover, we determine the toughness of the product of two complete graphs.
还给出了两个完全图乘积的坚韧度。
The whole vendition system is described by a network composed of complete graphs.
整个销售系统被一个完全图集合的网络描述。
The minimum sets of complete graphs are obtained respectively for 4-site neighborhood digital images.
对于四近邻的图像，建立了一组最小的完备图。
The minimum sets of complete graphs are obtained respectively for 8-site neighborhood and 4-site neighborhood digital images.
对于八近邻和四近邻的图像，分别建立了一组最小的完备图。
The edgeintegrity of some special graphs such as the grids , wheel , Cartesian products of some complete graphs etc are given.
文中主要给出了格子图，轮图，完全图的卡氏积等特殊图的边完整度。
Much effort has been spent on investigating the crossing Numbers of complete graphs, complete bipartite graphs and cartesian products graphs.
大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
We suggest extending the conception of social collaboration network to all the networks of sets of complete graphs where only collaboration relationship between the actors in the ACTS is considered.
我们建议把社会合作网络的概念进行推广，把所有仅仅考虑参与者在所参与的项目中的合作关系，因此整个网络成为完全图的集合的系统都称为广义合作网络。
You can create the rest of the business graphs to create a complete end-to-end scenario.
要创建完整的端到端场景，您可以创建其余的业务图。
Gremlin is a Turing Complete programming language useful for working with graphs.
Gremlin是操作图表的一个非常有用的图灵完备的编程语言。
It also can complete the functions of the dynamic displaying of the graphs and the figures and the indicator lights of the treatment states.
还可通过友好的人机界面，完成动态图形显示、动态数字显示、治疗状态指示灯显示、主界面动态转换等功能。
They almost completely characterized the uniquely 3-list colorable complete multipartite graphs.
他们几乎完全刻画了唯一3 -列表可染完全多部图。
An error is corrected and a complete proof of isomorphism theorem for tensor algebras over valued graphs is given.
纠正了关于赋值图的张量代数的同构定理证明中的一个疏忽，给出了此同构定理一个完整的证明。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
In this paper, some properties regarding the chromatic polynomials of graph on the complete-graph-basis and the chromaticity of some graphs by complete-graph - basis are discussed.
文章讨论了建立在完全图基上的色多项式的若干性质。并利用完全图基讨论了一些多边图的色性。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
应用推荐