边数很少时二部图度方和的次大值

The second largest value of the sum of squares of degrees in bipartite graphs with few edges

研究了给定顶点和边数且边数很少时二部图度方和的次大值.在确定了给定顶点和边数且边数很少时度方和达到最大的所有二部图后,通过讨论顶点数和边数之间的关系得出度方和的次大值.对于度方和问题在二部图中的研究有一定的推动作用.

The second largest value of the sum of squares of degrees with a given number of vertices and few edges for bipartite graphs is studyed. After determining the bipartite graphs with few edges where the sum of the squares of degrees is maximum, the second largest value is determined by comparing the range of the vertices and edges. It is useful for the research of the sum of squares of degrees for bipartite graphs.