查询词典 labeled graph

G° -N Graph is a kind of graph, which was first brought forward by A.

自由能一氧化态网是A、A、Frost①于1950年首先提I¨来的，它是以金属单质为基准△G。

On k-terminal Cut Problem of-graph and 3-terminal Cut Problem of (n,n+1)-graph

论文标题：图的k-终端割与（n，n+1）图的3-终端割问题研究

It is shown that every minimum geodetic set of a graph does not contain its cut-vertices, and if G is a block graph with n≥3 vertices and k≥1 cut-vertices,then g=n-k.

图的每个最小测地集都不包括它的割点，如果图G是一个有n≥3个顶点，k≥1个割点的块图，那么g=n-k。

Let α to be independence number of graph G, in 1984 Fan showed: Let G be a 2-connected graph of order n, for every pair vertices x,y of d=2, if max{d,d}≥n/2, then G is Hamiltonian.

1984年，Fan给出了著名的Fan定理：若2连通n阶图G的距离是2的任意两点x、y均有max{d，d}≥n/2，则G是哈密尔顿图。

In this paper well verify that it is true for tree(a special type of bipartite graph)vertex-multiplications, and it is a extention to one of the results in paper.In the second chapter, from the point of view of non-decreasing degree sequence we give a degree-maximal non-Hamilton simple balanced bipartite graph bm,n. We give a result below.

第二章中从图的不减度序列角度给出了一类度极大的非哈密尔顿简单平衡二部图，并且证明了：任何非哈密尔顿的简单平衡二部图，它的不减度序列一定弱于此类图中的某个图b_的度序列。

So with the adjacency matrix that has n vertices of a directed graph n2 units needed to store the adjacency matrix; on n vertices have an undirected graph Zexu into upper triangle, and only ...

因此用邻接矩阵来表示一个具有n个顶点的有向图时需要n2个单位来存储邻接矩阵；对有n个顶点的无向图则需存入上三角形，故只。。。

This paper proved that the MAXIS algorithm is a 2-approximation to the SC of proper interval graphs with Bounded Degree and α≤ω. where α is the maximum degree of vertices of graph, n is the number of vertices of graph.

本文证明了对一类特殊的真区间图Δ≤(4n~(1/4)且α≤ω，其中Δ是图G中点的最大次，n是图G的点数，α是G的最大独立点集所包含的点数，ω是G的最大团所包含的点数，MAXIS算法是解决其染色和问题的2-近似算法。

A shell graph of order n denoted by H(n,n-3) is the graph obtained from cycle C_n of order n by adding n- 3 chords incident with a common vertex say u.

一个有n个顶点的贝壳图H(n，n-3)，是通过在顶点数为n的圈C_n上一个公共点u上增加n-3条边得到的图。

The EMP format which is the software which conforms to the Naiad Interface and runs the simulation described by a Naiad Graph, this is an open-source software package allowing an artist to interactively construct a Naiad Graph using a 3D GUI front-end a standard file-format for storing the results of a Naiad simulation.

电磁脉冲格式的软件，这是符合奈德接口和运行由一奈德所描述的模拟图，这是一个开放源码软件允许艺术家以交互方式构造一个奈德使用三维图形界面的前端标准文件格式存储的奈德模拟的结果。

According to what graph 2 shows, conductor is still, uniform static magnetic field moves to the left at the speed of , referring to in graph 1 can get , substitute it into Lorentz magnetic force , it is , the negative sign here is not added randomly, it is because the moving direction of magnetic field is opposite to the moving direction of conductor.

如图2所示，导体是静止的，均匀的静态磁场以速度向左边运动，对照图1的，就得，带入洛伦兹磁力中，有，这里的负号不是随意加进去的，而是由于磁场的运动方向与导体的运动方向相反之缘故。

Alternatively, the con- trollers can use the synchronous rectifier itself or loss- less inductor current-sensing methods to provide overload protection with lower power dissipation.

另外，康威特罗勒斯可以使用同步整流器本身或亏损减少电感电流检测方法，以提供低功耗过载保护。

Mr. Dauber's other Schatz hangs in his home movie studio.

多伯把沙兹的另一件作品挂在家里的电影室。