图

He has proved that most, if not all, the connected cubic G-arc-transitive Coset graphs on the finite nonabelian simple groups are normal, further, has given bounds of the full automorphism on this kind of graphs.

利用陪集图的正规性可以给出某类图的全自同构群的界，且可以得到某类群具有陪集图表示的充分条件[2]，另外陪集图的正规性对于求给定群的最小级陪集图表示具有重要作用[3]。

Simulation results demostrate that the circuit simulation algorithmperforms better and it is applicable to more kinds of graphs,such as undirected graphs,directed graphs,and mixed graphs.6 At the end of the article,the applications of the algorithm in several fields aredescribed and the value of the method is pointed out.

测试表明，本算法在对几类常见图的同构判定中表现优于Nauty算法，而且可以适用于无向图、有向图及混合图等多种类型的图。6最后给出了电路模拟法在应用领域的成功应用实例，指出了电路模拟法的应用价值。

Others desynchronized with 5－90 Hz primary depth electrographic after-discharges;(2) primary electrographic after-discharges were driven by primary unit after-discharges in the anterior dorsal HPC;(3) primary unit after-discharges were induced by brief primary electrographic after-discharges; and (4) plasticity of primary electrographic after-discharges and inhibition of single neuron firing were induced by repetitive ATPDH.

非同步性后放电的深部电图癫痫样电活动具有宽频带特征(5－90 Hz)；(2)原发性单位后放-后抑制效应可以引发低频原发性电图后放电，长时程爆发式单位放电可以诱发高频原发性电图后放电；(3)短束原发性电图后放电也可以诱发原发性单位后放电；(4)原发性电图后放电和神经元单位放电的抑制效应具有明显可塑性特征。

As a graphical framework for formally describing interactive system, basic graph can represent processes and the interaction between processes in two ways: one is graphical representation, where a graph corresponds to a process and reduction in a graph corresponds to interaction between processes; the other is using term algebra consisting a set of terms and an equational theory on terms.

基本图是一种描述并发交互系统的形式化方法，它具有描述简洁、清晰和直观的特点。在基本图中，进程以及进程间的交互行为，既可以用图表示方法(其中一个图对应一个进程，图之间的归约对应进程之间的交互行为)，又可以用项代数来表示。

Based on the former chapter, one method based on fundamental matrix and crossrate is proposed in this chapter to render novel image considering the character of fundamental and cross-rate invariant in the perspective project, which utilized the correspondence relationship between the given two images and projective invariant between images to render novel image.

该方法通过将基本矩阵的稳定性求解问题转化为一个有条件的极值求解问题，结合遗传算法良好的全局寻优特点，将该方法很好地引入到基本矩阵的求解中，并取得了良好的实验结果。（5）第五章在上一章的基础上，综合基本矩阵和透视投影中的交比不变性的特点，提出了一种基于基本矩阵和交比的生成新图象的方法，这种利用已知两幅图象之间存在的匹配关系和新图象和已知图象存在的透视不变量，来生成新图象。

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图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

Then applying the second development tool of AUTOCAD, Visual LISP to scheme out the programs of plotting the network's systems drawing and the water isobar. Consequently, the whole set design from the node outflow distributing to plotting the network's systems drawing and the water isobar is completed.

然后应用AUTOCAD二次开发工具Visual LISP编写出绘制管网系统图程序和绘制等水压线图程序，在AUTOCAD平台上将平差或优化的结果快速成图，从而完成从节点流量开始到管网优化直至绘出给水管网系统图和等水压线图的一整套设计。

G.Fig. 3-4 and 3-5）which were isomorphic to the graph under consideration but [8] which contained no crossings.

让我们稍微改变一下话题，读者会记得我们在讨论图3-3时，曾经指出有些图（如图3-4和图3-5），与另一些不包含交叉线的图同构。

In chapter four, we study the second isoperimetric connectivity of line graphs and line digraphs. For line digraphs, we show that the second isoperimetric connectivity of strongly connected line digraphs with δ≥ 2 equals its connectivity. For line graphs, we give a sufficient and necessary condition for the existence of the second isoperimetric connectivity, and we show that under the condition that the second isoperimetric connectivity exists, the second isoperimetric con

第四章研究线图和有向线图的第二等周点连通度，得到了如下结果：(1)最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度；(2)对于无向线图，我们给出了第二等周点连通度存在的充要条件；(3)对于第二等周点连通度存在的无向线图，它的第二等周点连通度或者等于限制点连通度或者等于最小度和次最小度的和。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。