Abstract：This paper discusses some properties of the clique incidence graph of the simple geodetic block G, and gives a upper bound of the number of edges for a kind of geodetic blocks with diameter two. The main result is as follows: If every vetex of G is a clique-vetex, then |E(G)|, where k is the number of venices of a clique of G.
收稿日期: 1996-02-25
引用本文:
李学超. 一类测地图的边数的估计[J]. , 1996, 35(2): 0-0.
李学超. AN ESTIMATE OF THE NUMBER OF EDGES FOR A KIND OF GEODETIC GRAPHS. , 1996, 35(2): 0-0.
