等距图及其性质

Equidistance Graph with Properties

连通性是图的一个重要概念.本文利用文献[2]中提出的表征图的连通性的新概念联系数,研究了一类特殊的图:k-等距图,即图的半径和直径均为k的图,得到的主要结果有:k-等距图是块;k-等距图最大度和团数的上界;k-等距图生成树的半径是k.

Connectivity is one important theme in graph throry. This article studies a kind of particular graphk-equidistance graph by the use of a new concept, link number, proposed in . We acquire the following conclusion: k-equidistance graph is block; The upper bounds of max-degree and clique number in k-equidistance graph; The radium of the spanning tree of k-equidistance graph is k.