查询词典 transitive graph

Let G = V(G,E be a simple graph with |V| vertices and |E| edges. Let |V|= p,|E|= q, if there exists f: V →{1,2,...,p} be an injective mapping, and define an inducedfunction f":E→{1,2,...,q} by setting f"=|f-f| for all∈E. If f maps E onto {1,2,...,q}, then f is said to be a Skolem-graceful labeling of G, the graph G is said to be a Skolem-graceful graph.

对一个给定的简单图G=V(G，E，|V|和|E|分别是图G的顶点数和边数，令|V|=p，|E|=q，如果存在一个一一映射f：V→{1，2，…，p}，使得对所有边∈E，由f′=|f-f|所导出的映射函数f′：E→{1，2，…，q}是一一对应关系，则称f是图G的一个Skolem优美标号，图G被称为Skolem优美图。

By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.

利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

A graph G is edge reconstructible if every edge reconstruction of graph G is isomorphic to graph G.

如果图G的每个边重构图都与图G同构，则称图G是边可重构的。

And in the same paper, Rose proved that if G is a graph with q edges, then graph K_{2q+1} can be partitioned into 2q+1 graphs which are isomorphic to graph G.

Rose在文献[2]中指出了Ringel猜想的证明与优美树猜想有关，并给出了一般的结论：设G是一个q条边的优美图，那么K_2q+1可分解出2q+1个图都同构于G。

E. MCNG-ISOMAP (Minimal Connected Neighborhood Graph-based ISOMAP), which can prune effectively "shortcut" edges, existed possibly in the neighborhood graph, based on that the minimal connected neighborhood graph can avoid "shortcut" edges effectively.

该算法能在一定程度上避免邻域大小难以有效选取的问题，同时还能在不依赖于邻域大小的情况下发现数据真正的固有维数。

A free edge in a Ramsey graph of K n is defined as whatever does the edge to be colored by one of two colors respectively,the graph will keep to be a Ramsey graph of K n.

在 Ramsey图 Kn中一条自由边定义为，即使单独改变这条边的颜色，所得到的新图仍是一个二色 Ramsey图 Kn 。

To prove one edge union of k-shell graph is cordial, firstly fix the labeling of vertex of common edge(label u with 0 and v with 1), then according to the value of the graph order n module 4 to class the k shell gaphs to four cases, and to divide to small cases in every shell graph.

本文研究k-贝壳图的亲切标号时，在固定了公共边上的点的标号(对u标号0且v标号为1)之后，我们采用如下方法：首先，以每个贝壳图的顶点数对4取模的余数来分类，这样就得到了四种(来源：d1ABC论文网www.abclunwen.com)不同情况的贝壳图；然后在每个贝壳图中再分情形进行标号；最后，通过证明得到这种标号方法是满足亲切标号的定义的，从而证明了k-贝壳图的亲切性，成功的解决了Sethuramam和Selvaraju猜想，证明了其正确性。

This paper explained the function and the structure of graph symbolism in details, and proposed the special significance of the culture to the graph mark , it has proven the characteristic that the graph mark and the cultural is paragenesis altogether ,through the concrete socialphenomenon.

本文详细解读了图形符号系统的功能和结构，由此提出了文化之于图形符号的特殊意义，并通过具体的社会现象论证图形符号与文化的共生共融的特性。

By using the graph-theoretic method, the completion problems for a partial inverse Mmatrix with any order are discussed when its corresponding graph of the partial inverse M-matrix is a 2-chordal graph .

本文采用图论的方法对任意阶部分逆M矩阵，当其对应的图为2-弦图时，研究了其逆M矩阵的完备问题。

The multilevel partitioner of MVP achieves the better partitioning of weighted undirected graph by introducing the graph core during the coarsening phase,the spectral graph theory during the initial partitioning phase and swarm intelligence during the refinement phase.

MVP系统的多水平剖分程序引入图核到粗化阶段，谱图论到初始剖分阶段，群智能到投影优化阶段，得到了无向赋权图更优的剖分。

These rules reflect some inherent feature of self and nonself, and they are the basic detection criterion of GECISM.

这些规则反映了"自我"和"非我"的内在特征，是GECISM进行"非我"检测的判据。

Until today, the media from China and the outside world still uses the term "Post 89". Regardless to whether it is for commercial gimmick or convenience, everybody still remember "Post 89", a term which carries a strong Cantonese accent.

时至今日，国内外艺术媒体还是在沿用&后八九&这个称谓，不管当初是为了商业噱头还是容易上口好记，反正大家现在是记住了&后八九&这个广东口音很重的词。