您要查找的是不是：
- The cyclic edge connectivity of a graph is the size of a minimum cyclic edge cutset of a graph. 一个图的圈边连通度是指最小圈边割的边数。
- The 2-extra edge connectivity of the hypercubes and the 1-extra edge connectivity and restricted edge connectivity of the folded hypercubes are determined. 摘要确定了立方体的2-超边连通度和折叠立方体的1-超边连通度和限制边连通度。
- Every edge connects a vetex labeled 3 with a vertex labeled 4. 每一条线都联结一个标上3和一个标上4的顶点。
- Every edge connects a vertex labeled 3 with a vertex labeled 4. 每一条线都联结一个标上3和一个标上4的顶点。
- Every edge connects a vetex labeled 3 with a vertex labeled 4 . 每一条线都联结一个标上3和一个标上4的顶点。
- Restricted Edge Connectivity and Regular Factor 限制边连通度与正则因子
- The upper bound for the maximal edge number of the graph has been derived, and a few valuable corollaries are also given. 给出图的最大边数的上界，并在此基础上得出了几个有用的推论。
- k - restricted edge connectivity k阶限制边连通度
- 1 - restricted edge connectivity 1-限制边连通度
- By using the quadratic integer programming method, the problem about the maximal edge number of a graph with a fixed vertex-neighbor-integrity is studied. 摘要本文用二次整数规划法研究给定邻域完整度的图可能具有的最大边数问题。
- 3 - restricted edge connectivity 3阶限制边连通度
- Method in which each conductive lead on the contact edge connects to one segment or annunciator. 每一个在接触上导电领头的方法边缘连接一部分或者预报信号。
- "Waste not, want not" is her favorite maxim. “不浪费则不匮乏”是她特别喜爱的格言。
- Comment: A graph is called BIPARTITE if its vertex can be parted into two parts such that every edge connects one vertex in one part and another vertex in another part. 说明：如果能够把一个图的顶点分成两部分，使得每个边连接的两个点，都必然分别在两个部分中，那么称这个图为“二部图”。
- "Waste not, want not" is a popular maxim. "勤俭节约，吃穿不缺"是一条盛行的座右铭。
- Maxim seems to be particularly fond of her. 马西姆似乎特别喜欢她。
- The factory is situated on the edge of the town. 这座工厂坐落在该城的边上。
- The hotel is situated at the edge of the town. 该饭店坐落于市区的边缘。
- The plates and bowls have a gilt edge. 这些盘子和碗镀有金边。
- A terse, witty, instructive saying; a maxim. 格言，箴言，警句简洁、机智、有教导性的话; 警句
