- 更多网络例句与无向边相关的网络例句 [注：此内容来源于网络，仅供参考]
-
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.
他忍住所有痛苦，使尽仅存的力量和长久来已消磨殆尽的骄傲，来和这条鱼的痛苦相互抗衡，鱼终于被他拉近船边，慢慢游向他身边，鱼的尖嘴几乎碰到船板。它开始靠着船边游，它的身影长长的、又深又宽，银色的身躯外裹着紫色的条纹，无止尽地在水中游动。
- 更多网络解释与无向边相关的网络解释 [注：此内容来源于网络，仅供参考]
-
adhere：依附
图 ( Graph )是由顶点的有穷 非空 集合和顶点之间边的集合组成,通常表示为:在无向图中,对于任意两个顶点 v i 和 v j ,若存在边 ( v i , v j ) ,则称顶点 v i 和 v j 互为邻接点( Adjacent ),同时称边 ( v i , v j ) 依附( Adhere )于顶点 v i 和
-
adjacency multilist：邻接多重表
邻接多重表(Adjacency Multilist)主要用于存储无向图. 因为,如果用邻接表存储无向图,每条边的两个边结点分别在以该边所依附的两个顶点为头结点的链表中,这给图的某些操作带来不便. 例如,对已访问过的边做标记,或者要删除图中某一条边等,
-
digraph：有向图
对于一个图G,若边集E(G)为有向边的集合,则称此图为有向图(digraph),若边集E(G)为无向边的集合,则称此图为无向图(undigraph). 下图a和b分别为一个无向图G 1 和有向图G 2 ,图中每个顶点里的数字或字母为该顶点的符号、编号或关键字,每个图对应的顶点网络的例子(二)图的基本术语
-
Directed：有方向性
方向性:边可以分为有方向性(directed)和无方向性(undirected)两种,有方向性的边称为有向边,无方向性的边称为无向边;同理有方向性的图形称为有向图,无方向性的图称为无向图.
-
simple cycle：简单回路
如果某个无向连通图的任意一条边至多只出现在一条简单回路(simple cycle)里,我们就称这张图为仙人图(cactus). 所谓简单回路就是指在图上不重复经过任何一个顶点的回路.
-
simple graph：简单图
具有共同端点的边称为相邻边一条边的两个端点相同,称为自环(self-loop);具有两个共同端点的两条边称为平行边(parallel edges)既没有自环也没有平行边的图称为简单图(simple graph)在无向图中,与节点相关联边的数目,
-
Minimum Spanning Tree：最小生成树
给定一个连通无向图G,且它的每条边均有相应的权值,则图G的最小生成树(Minimum Spanning Tree)是指生成树中边的权值之和最小的一棵生成树.
-
undirected：无方向性
方向性:边可以分为有方向性(directed)和无方向性(undirected)两种,有方向性的边称为有向边,无方向性的边称为无向边;同理有方向性的图形称为有向图,无方向性的图称为无向图.
-
Velour：蜜丝绒
(三)蜜丝绒(velour):类似剪毛布,但毛长在1.5-2mm左右,弹性相对剪毛布较大;无毛向. (四)边纶布(Nylex、Tricot):又分普通边纶布(100%Polyster)和尼龙边纶布(Nylon),通常用的都是普通型. 制作,裁片丝印,刺绣都较容易,
-
unoriented：未定向的 无定向的
unorganizedferment 非活体酶 离体酶 | unoriented 未定向的 无定向的 | unorientedcobordism 无定向配边