手机知网 App
24小时专家级知识服务
打 开
数学
BALANCED INCOMPLETE BLOCK DESIGN AND THE CONSTRUCTION OF GEODETIC BLOCKS
<正> We only discuss finite undirected simple graph.Suppose graph G is connected. If for each pair of vertices x and y of G there is the unique shortest path which connects x and y, then G is called geodetic graph. If G is 2-connected geodetic graph, then G is called geodetic block.
1 8
手机阅读本文
下载APP 手机查看本文
Chinese Science Bulletin
1990年21期

搜 索