Using it the directed tree polynomial of a directed graph G can be found conveniently and efficiently.
应用它可以方便且有效地求出一个有向图G的有向树多项式。
Line 1 declares your graph, called g, and its type (a digraph).
第一行声明这个图为g，并且声明了该图的类型(digraph)。
To prove the theorem we shall suppose that the graph G is drawn on a sphere as described above.
为了证明这个定理，我们假定这个圆G能按上述方式画在一个球面上。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
The number of 3-nodes connected induced subgraphs S3(G) in a graph G plays a important role in the reliability of a network.
一个图G中所含的三结点连通导出子图的个数记为S_3（G），它在网络可靠性中起着重要作用。
是一个极大无圈图。
G is a minimal connected graph.
是一个极小连通图。
The diameter of a graph G is the maximum distance between pairs of vertices of G .
一个图G的直径是G的所有点对间距离的最大值。
In this paper, we assume G is a finite group and its modular character degree graph has two connected components.
本文假设G为一有限群且G的模特征标度图有两个连通分支。
Its expansion gives all directed trees of the graph g.
它的展开式将给出图g的全部有向树。
In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
This paper presents an algorithm for solving a complete monotonic chain set in the planar straight line graph g.
本文提出求平面直线图完全单调链集的一种算法。
A graph G is supereulerian if G has a spanning eulerian subgraph.
若图G含有生成欧拉子图，则称G是超欧拉的。
Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor.
一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。
If G is Hamiltonian, then its line graph L(G) is pancyclic graph.
若G是哈密顿图，则其线图L（G）是泛圈图。
In this paper, we mainly study consecution of consecutive graph under several operations. also we determine bounds of irregularity strength and (g) for there classes of graphs.
本文讨论连续的图在几种图运算下的连续性，证明了几类特殊图是连续的，并得到它们的非正则和以及非正则强度的界。
The path spectrum of a graph g, denoted by ps (g), is the set of length of all maximal paths in the graph.
如果图中的一条路不是其他任何路的子路，则称这条路为该图的一条极大路。
The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.
图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。
G is said to be bipartite matching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.
称g是偶匹配可扩的，如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。
The two-dimensional bandwidth problem is to find an embedding of graph G in a grid graph in the plane so that the longest edges are as short as possible.
二维带宽问题是将图G的顶点嵌入平面格子图，使其最长的连线尽可能短。
It is proved that a simple graph G is automorphism line graph if and only if the graph G is 2-regular graph.
首次给出自构线图的定义，并证明：简单图G为自构线图的充要条件是图G为2-正则简单图。
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的边不相交圈的最大数目。
In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
The area below this curve is measured, e. g. by counting small squares if graph paper is used.
要测出这条曲线下的面积，例如，可使用方格纸以计数曲线下小方格的数目。
The tenacity is a better parameter to measure the stability of a network g, as it takes into account both the quantity and order of components of the graph.
粘连度是一个较好的参数，因为它把网络被破坏后的最大分支的阶和分支的个数联合起来考虑。
Extensive monitoring possibilities, e. g. oscilloscope function, history graph for measuring signals.
广泛的监控可能性，如示波功能，测量信号的历史曲线显示等。
The two dimensional bandwidth problem is to determine an embedding of graph G in a grid graph in the plane such that the longest edges are as short as possible.
二维带宽问题是：确定图G在平面格子上的一个嵌入，使得最长边尽可能短。
The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
To prove its correctness, the following conditions are prove to be equivalent:(1)Graph G is connective;
为了证明它的正确性，本文将证明以下三个条件是等价的：（1）图G是连通的；
To prove its correctness, the following conditions are prove to be equivalent:(1)Graph G is connective;
为了证明它的正确性，本文将证明以下三个条件是等价的：（1）图G是连通的；
应用推荐