graph的例句大全

In this article, we introduce maximal connected subgraphs, maximal clique and perfect match of graph theory in biology especially in the study of protein structure research applications.

本文介绍了最大连通子图、最大团和完美匹配等图论知识在生物学尤其在研究蛋白质结构研究方面的应用。

Let δ,κ,γ, I and α be the minimum degree, the connectivity, the domination number, the independent domination number and the independence number of a graph G, respectively.

设G是一个图.G的最小度，连通度，控制数，独立控制数和独立数分别用δ，κ，γ，i和α表示。

Given the information of local connectivity of single nodes, the random graph model is an effective means to analyze geometry of network in macroscopic way.

连通分析模型在考察各类预置方案的连通性能方面具有重要的理论意义。给定微观个体节点的本地连通度，随机图模型是分析宏观网络的几何性质的有力工具。

In this thesis, a detailed analysis of assembly modeling research status is brought forward firstly, then suggests an enhanced connectivity graph and its connectivity matrix to express product information and the interrelationship between the parties of the disassembly.

本文对拆卸建模的现状进行了详细的分析，采用增强联接图和增强联接矩阵表达产品拆卸信息和装配体中零部件之间相互关系。

Now that the compact function connectivity matrix is built, it's time to build its graph.

现在我们已经构建了简化的函数连通性矩阵，接下来应该构建图形的表示了。

Let's dig into Graphviz to understand how a call graph is generated from the connectivity matrix.

让我们深入研究Graphviz，了便理解如何从连通矩阵生成一个调用图。

In this thesis, we mainly study the super restricted edge connectivity for several graph-classes.

本文主要研究了几类图的超级限制边连通性。

Let G be a finite simple connected graph with a perfect matching.

设G是一个连通的简单图且具有完美匹配。

Let G be a simple finite connected graph.

设G是一个有限的简单连通图。

A Note on the p Critical 2-Edge-Connected Graph

关于p阶临界2边连通图的一个注记

In this paper, the bond cover of a connected graph was studied.

对连通图的键覆盖进行了研究。

The inverse degree and R and IC of simple connected graph

简单连通图的反比度和几何反比度

The reasonable orientation problem of 2-edge connected graph

2-边连通图的合理定向问题

Clustering Algorithm Based on Dynamic Division of Connected Graph

基于连通图动态分裂的聚类算法

The relationship between the boiling points of alkynes and their molecular graph

炔烃的沸点和分子结构图

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

The dual bandwidth of a graph G, denoted by ( G), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

The adjunction algorithm for planarity of graph

图的平面性添加算法

The Hamming-Graph Learning Algorithm of BNN

二进神经网络的汉明图学习算法

Based on the necessity of the application of blank in poster design, the flexible use of bank is presented in three aspects including page arrangement, graph and background, and graphic proportion.

本文从招贴设计中空白运用的必要性出发，从版面大局、图形与背景、画面比例三个方面分别阐述空白在现代招贴中的灵活运用。