摘要
本文定义S_k(G)为G中所有点对之间距离的k次方之和.利用顶点划分的方法得到了直径为d的n顶点连通二部图S_k(G)的下界,并确定了达到下界所对应的的极图.
Denote the sum of k-power of all distances between all pairs of vertices in G by Sκ（G）. In this paper, by applying the vertex partition method, sharp bound of all connected n- vertex bipartite graphs of diameter d on the Sk（G） is obtained, and the extremal graphs with the minimal Sk（G） are also characterized.
出处
《数学杂志》
北大核心
2017年第6期1111-1117,共7页
Journal of Mathematics
基金
Supported by National Natural Science Foundation of China(11401008
61672001
61572035
61402011)
China Postdoctoral Science Foundation(2016M592030)
关键词
二部图
直径
极图
bipartite graph
diameter
extremal graph
