论文部分内容阅读
A loopless graph on n vertices in which vertices are connected at least by a and at most by b edges is called a(a,b,n)-graph.A(b,b,n)-graph is called(b,n)-graph and is denoted by Kbn(it is a complete graph),its complement by Kb n.A non increasing sequence