查询词典 graph theory

The Innovation Graph Technique is very good at real-time, so this paper goes deep into the research that the identification of topology change, bad data utilizing Innovation Graph Technique and its practicality in order to expand the theory of Innovation Graph Technique and supply a approach which can identify bad data and topology change in real lager-scale power network quickly and effectively.The model of the Innovation Graph is further studied in this paper.

新息图状态估计具有良好的实时性，本文对其在拓扑变化辨识、不良数据辨识及实用化方面进行了深入研究，旨在拓展新息图理论，提供快速有效的、可实用化的拓扑变化和不良数据辨识方法。

According to the distances, the SPWUG algorithm computed the initial partition of the coarsest graph by extending the Laplacian spectral graph theory from the unweighted undirected graph into the weighted undirected graph.

SPWUG算法借助Laplacian矩阵次小特征值对应的特征向量，刻画了节点间相对距离，将基于非赋权无向图的Laplacian谱理论在图的剖分应用方面扩展到无向赋权图上，实现了对最小图的初始剖分。

Taking the active network as a research task, the input accessibility, the Coates graph of matrix and graph transmission etc are used to analyze the relation between reducibility of the coefficient matrix of the state equation and the electric separability of the network or the electric accessibility of the network for the first time, acquiring sufficient and necessary conditions that coefficient matrix of the state equation is reducible. Network Graph Theory, Matrix Theory and System Theory over F etc are used to derive the structural controllability criterion of the passive network over F for the first time. Then according to these theoretic results, the structural controllability problems of the active network over F are studied, acquiring several structural controllability conclusions of the active network.

率先将状态方程的输入可达、矩阵的Coates图、流图传输系数等概念和方法引入到对F上有源电网络的研究，研究了网络状态方程的系数矩阵的可约性与网络电气可断性或电气可达之间的关系，研究了F上有源电网络的能控性问题，获得了状态方程的系数矩阵可约的充分必要条件、F上有源电网络系统的结构能控性判据等新的结论。

This paper briefly introduces the graph theory, expounds the inter na l relations between the graph theory and the technical dimension chain , and desc ribes the method of resolving technical dimension chain by using graph theory th rough actual examples.

简要地介绍了图论理论，阐述了图论与工艺尺寸链的内在联系，并通过示例具体介绍了应用图论求解工艺尺寸链的方法。

The line graph of further complete bipartite graph(infinite graph of n≥6) is extendable graph.

进一步完全二部图(n≥10的无限图)的线图是可扩圈图。

One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.

其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。

Let be the maximum degree of a vertex in graph . Chen et al. conjectured that a connected graph is equitable -colorable if is not a complete graph , or an odd cycle , or a complete bipartite graph for all .

令 表图上的点的最大度数，陈伯亮等人，提出以下这个猜测：如果一个连通图不是，这三类的话，则可以用个颜色来均匀著色。

It allows each edge of a graph data set to be with different interval-gap value. For example, given a graph with n edges, the interval-gap concept provides n interval-gap values, Min_Gap and Max_gap, for these edges correspondingly. By incorporating this concept into the graph mining, discovering frequent sub-graph with time constraints can be more effective.

在本论文中提出了区间间隙的概念，主要即是由固定的Min_Gap、Max_gap将之修改调整为弹性的Min_Gap与Max_gap，此区间间隙弹性的地方即在於图形资料集里的任两个节点所串连的边皆会有不同的区间间隙，也就是一个具有n个边的图形里，将会有n个不同的区间间隙值，也就是Min_Gap与Max_gap，这样的作法对於具有时戳性质的图形探勘将更有效益

This paper presents and discusses some generating principles and methods of the test graph on the system level fault diagnosis about random test graph,limit t fault diagnosable test graph, t fault diagnosable test graph and so on.

提出并研究了系统级故障诊断测试图中任意测试图、受限t可诊断系统测试图和t可诊断系统测试图的生成原理及方法，还给出了一个典型测试图的生成实例。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

Putt your way through 36 fun-filled holes of minigolf on 3D designed courses with elevated greens, bunkers, bridges and water hazards, among other crazy obstacles.

您的推杆方式，通过36个有趣的填孔迷你的三维设计的课程，以提升绿党，掩体，桥梁和水的危害，除其他疯狂的障碍。

Some participles can be used either as attributes or as predicatives.

有些分词既可当定语用，也可当表语用。