查询词典 graph

The minimal vertex-covering problem of graph is a NP-complete problem of graph theory.

图的最小顶点覆盖问题是图论中的一个NP完全问题。

MethodsBased on the structure of gene frequency matrix, we combine the method of multidimensional scaling analysis with the minimal spanning tree of graph theory, to set up the model of graph theory multidimensional scaling analysis.

提出基因频率矩阵的图论多维尺度分析方法，探讨该法在人类群体遗传结构研究中的应用。

In here we study k-fault broadcasting graph in f mode, and give an algorithm to decide the least time in the minimal k-fault f-broadcasting graph. All factors are studied qualitatively.

在这里，我们讨论了f模式下的k容错广播图问题，给出了确定极小k容错f广播图中广播时间的算法，定性分析了各种影响因素的作用效果。

We newly define the minimal broadcasting graph in f mode, and prove the rationality of the definition. We study the essential characters of the minimal f-broadcasting graph and the especial qualities in an special f, which is familiar in the competition self-combination network.

针对f模式重新定义了极小广播图，并证明了定义的合理性；讨论了极小f广播图的基本性质并针对竞争自组网中一种常见的f模式讨论了其特殊性质。

Methods Based on the structure of gene frequency matrix,we combine the method of principle components analysis with the minimal spanning tree of graph theory,to set up the model of graph theory principle components analysis.

结果图论主成分分析的基本步骤可概括为：①对中心化基因频率的协方差矩阵进行主成分分析；②按图论原理求过m维空间n个点的最小生成树；③利用求"颈"法分割最小生成树；④将最小生成树整合到二维主成分散点图中构建图论主成分分类图。

In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.

文中把图论里Edmonds定理的树花容量扩展为最小复盖点，并得到了计算非偶图最小复盖点数的公式。

In this paper, the maximum graph packing and the minimum graph covering of two graphsD_1, D_2 with six vertices and eight edges and the 8-cycle C_8 are researched.

在统一的构作方法下，对于两个六点八边图所有可能的v和λ给出了相应的最大图填充和最小图覆盖的构造。

Factors with prescribed properties such as factors including or excluding some given edge, maximum or minimum factors, factor covering and connected factors; 3. Factorizations of graphs; 4. k-extendable graph and its generalizations. Fractional graph theory is a relatively younger research branch.

例如，因子与图的最小度，韧度，联结数：邻域并等参数之间的关系；2·研究图的有限制条件的因子，例如，有约束条件的因子，图的连通因子，图的最大最小因子；3·图的因子分解；4·k-可扩图及其推广等。

This thesis presents a systematic research on two types of graphs, that is undirected graph and mixed graph.

分别对无向图和混合图这两类图进行了进一步研究。

Firstly, we give a new upper bound of a mixed graph′s largest Laplacian eigenvalue, which is more precise. And also we give a lower bound of a mixed connected graph′s largest Laplacian eigenvalue.

首先给出了混合图的最大Laplace特征值的一个新的上界，并且用实例说明我们的结果与以往结果相比更精确，同时也给出了一个连通混合图的最大Laplace特征值的一个新的下界。

The studies on the developing of new media are very important to the increasing of the area density of HDD and to the implementation of hybrid recoding technology.

光磁混合记录方法，是一种可以突破超顺磁极限的限制，并进一步提高硬盘记录密度和读写速率的一种新型超高密度信息存储方式。

In io, mTOR inhibition promotes T cell anergy under conditions that would normally induce priming.

体内研究中，在正常可激发免疫反应的条件下，抑制mTOR可促使T细胞无能。