有给定半径的自中心图的最大边数

The maximum size of self-centred graphs with a given radius

运用组合递归技巧证明了半径为 T 的 n 阶自中心图的最大边数满足某一关系,给出了几个有关的猜想.

Using the iterative technique,it is proved that the maximum size e(n,r) of a self-centred graph with r(G)=r,|G|=n satisfies e(n,r)≤(n-2r+3 2)+n and the minimum clique number θ(G)≥2r-1.Some related problems are also presented.