Number of sides for the polygon ; must be greater than or equal to 3 多边形的边数；必须大于或等于3 。
The sum of all the degree is 24 , an even number , which is twice the number of edges 所有次数的和是24 ，是个偶数，它是边数的两倍。
We denote this path by r . and we denote by r the number of edges in r and call it route length 路r所包含的边数称为它的长度，记为| r | 。
Therewith he lined up the last two and proceeded to the head , counting as he went 说罢，他让最后两个人站到队伍里，然后自己朝队首走去，边走边数着人数。
On the refrained domination number of graphs , this thesis mainly discusses the bound of it by edge number 对于图的受限控制数，本文主要讨论了其以边数为参数的上下界。
Proved that kn - h has an ascending star decomposition when the size of h is less than 4p , where h is a subgraph of the complete graph kn 当n阶完全图凡的子图h的边数小于了时kn ? h有星升分解? 12引进了慧星的概念并证明了以下结果
To pancyclic graphs , bondy ( 1971 ) proves a classic theorem that every hamiltonian graph of order n and size exceeding n 2 / 4 关于泛圈图， bondy ( 1971 )证明了下面经典定理：每个边数至少为n ~ 2 / 4的n阶hamiltonian图是泛圈图或完全二部图。
As a generalization , it is given in this paper the necessary and sufficient conditions for the existence of an h - decomposition of kn ( g ) 作为这一结果的推广，本文就五个边数小于等于5的五点图h给出了k _ n ( g )的h -分解存在的必要且充分条件。
Theory , adelaide , australia , 2005 , pp . 975 - 979 . 2 schwartz m , vardy a . on the stopping distance and the stopping redundancy of codes . ieee trans 从tanner图的观点来看，停止集s是gh中变量节点的子集使得s邻居的每一个校验节点与s相连的边数大于等于2 。
Given the number of vertices and the number of edges in a class of graphs , the problem of how to determine a graph that has the minimum integrity among the class is studied 对于所有的顶点数和边数都给定的连通图类，如何确定该图类中完整度最小的图。
