An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
Not only can a single rainfall process but also erosion and hydrological process in a certain time of cycle be analyzed, the results can be printed in figure, graph or curve.
模型既可对单一的降雨过程进行分析，也可对一定时间周期内的侵蚀和水文过程进行分析，并且可用数据、图形和曲线等形式输出运行结果。
This paper discusses the application of degree in other aspects of graph theory, such as cycle, Hamiltonian graph and matching on the base of reference.
在已有文献的基础上，讨论度在图论其它方面，诸如在圈、哈密顿图、匹配中的应用。
If an appropriate vertex isn't found, the graph must have a cycle.
如果没有这样的顶点，则图必然存在环。
The necessity, as well as foundation and opportunity, of new specialty setting and old specialty reform is explained by the help of graph, and the concept of specialty life-cycle is proposed.
借助图形形象地说明新专业设置与老专业改造的必要性以及依据和时机等，并提出了专业生命周期的概念。
This paper obtains several sufficient conditions on the degrees for an oriented graph which contains a path or cycle of length greater than or equal to a given value.
本文对定向图中存在长不小于给定值的路和回路给出了关于次的几个充分条件。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
The full cycle extensibility of a graph is the strongest one of the cycle properties of graphs, so the study on the full cycle extensibility of a graph is more important.
图的完全圈可扩性是图的圈性质中最强的性质，这使得对图的完全圈可扩性的研究尤为重要。
The best possible upper bound of a graph is determined, the exact values are also determined for path, cycle and complete multipart graph.
并确定了路、圏和完全多部图的控制临界数的精确值。
The interdependent relationship between the Hamiltonian cycle and 4-colouring of the planar graph in the dual have discussed.
阐明了平图中的H圈与对偶图顶点四着色的依存关系。
The business cycle is a graph that depicts the real-output of the economy with respect to time.
商业油气是一张图，它描述了相对于时间的世纪经济产出。
In this paper we discuss the distribution of vertices of degree 5 on the longest path and cycle and thus give a characterization of contraction critical 5-connected graph in a certain aspect.
讨论收缩临界5 -连通图最长路和最长圈上5度点的分布情况，刻画收缩临界5 -连通图的结构。
A new approach is proposed in this paper, based on the cut space and the cycle space in the graph theory.
但是与相对较为成熟的圈空间理论相比，对割空间的研究则显得较少。
A new approach is proposed in this paper, based on the cut space and the cycle space in the graph theory.
但是与相对较为成熟的圈空间理论相比，对割空间的研究则显得较少。
应用推荐