无向边

Let G be a finite group, and S a subset of G not containing theidentity element 1. The Cayley digraph Cay on G with respect to S is definedas a directed graph with vertex set G and edge set {|g∈G, s∈S}. IfS~(-1)=S, then Cay is undirected and in this case, we view two directededges and as an undirected edge {u, v}. Obviously, the right regularrepresentation R of G, the acting group of G by right multiplication, is asubgroup of the full automorphism group AutCay(G, S of Cay.

给定有限群G，设S是G的不含单位元1的子集，群G关于子集S的Cayley有向图Cay是一个以G顶点集合，而以｛|g∈G，s∈S｝为边集合的有向图，特别地，若S~(-1)=S，则X=Cay是无向的，此时我们把一条无向边｛u，v｝等同于两条有向边和，易见，群G的右正则表示R，即G在G上的右乘作用，为图Cay的全自同构群AutCay

I We present a characterization of equivalent chain graphs based on local transformations, and give an algorithm to transform one chain graph into an equivalent one.

链图可以含有有向边和无向边，因而能够反映相关关系和因果关系，我们主要讨论了三个问题。

Autonomous systems of the Internet form a huge complex network connected by physical links,in which the autonomous systems and links among them can be regarded as vertices and edges of an undirected graph.

因特网的自治系统(AutonomousSystem简称AS)构成了一个由物理链路连接起来的庞大的复杂网络，其中的自治系统及其之间的连接可以看作是无向图中的顶点和边。

Given a ring and a set of communication requests. Each request is represented by a pair of nodes, and associated with a profit. To satisfy a request in the undirected ring, we need to determine a path between the two nodes of the request in the ring. To satisfy a request in the directed ring, we need to determine a directed path from the source to the destination of the request in the directed ring. The goal of the call admission control problem is to determine and satisfy a maximum profit subset of the requests such that for every edge of the ring, the number of satisfied requests that are routed through the edge does not exceed the capacity of the edge.

要在无向环中实现一个呼叫，需在环中指定该请求所对应的两个顶点之间的一条路，要在有向环中实现一个呼叫，需在环中指定该请求的源节点到目的节点的一条路，环网络呼叫接纳控制问题的目标是确定最大利润的呼叫子集，在环中实现该子集中的每一个呼叫，使得经过每一边的呼叫的数目不超过该边的容量，对于无向和有向环网络呼叫接纳控制问题，我们均首次给出了多项式时间近似方案。

The super restricted edge connectivity provides a more accurate index of fault-tolerance of networks.

本文主要研究了有向de Bruijn图的限制边连通度和无向de Bruijn图的超级限制边连通性。

Ore gave an upper bound of the number of edges of an undirected graph in terms of order and diameter of the graph.

Ore通过图的顶点数和直径给出无向图的最大边数。

Markov network is an undirected graph, it could be the uncertainty of knowledge, reasoning, No words can explain to the edge between relevance, through Markov network learning mechanism words of relevant information.

Markov网络是一个无向图，它可进行不确定性的知识推理，无向边可解释词间相关性，通过Markov网络学习机制获得词的相关信息。

A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs.

用一条弧或一对方向相反的弧代替完全多部无向图的每一条边所得到的有向图被称为是半完全多部有向图。2002年L。

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

He took all his pain and what was left of his strength and his long gone pride and he put it against the fish's agony and the fish came over onto his side and swam gently on his side, his bill almost touching the planking of the skiff and started to pass the boat, long, deep, wide, silver and barred with purple and interminable in the water.

他忍住所有痛苦，使尽仅存的力量和长久来已消磨殆尽的骄傲，来和这条鱼的痛苦相互抗衡，鱼终于被他拉近船边，慢慢游向他身边，鱼的尖嘴几乎碰到船板。它开始靠着船边游，它的身影长长的、又深又宽，银色的身躯外裹着紫色的条纹，无止尽地在水中游动。

However, as the name（read－only memory）implies, CD disks cannot be written onorchanged in any way.

然而，正如其名字所指出的那样，CD盘不能写，也不能用任何方式改变其内容。

Galvanizes steel pallet is mainly export which suits standard packing of European Union, the North America. galvanizes steel pallet is suitable to heavy rack. Pallet surface can design plate type, corrugated and the gap form, satisfies the different requirements.

镀锌钢托盘多用于出口，替代木托盘，免薰蒸，符合欧盟、北美各国对出口货物包装材料的法令要求；喷涂钢托盘适用于重载上货架之用，托盘表面根据需要制作成平板状、波纹状及间隔形式，满足不同的使用要求。