【摘要】 在研究运输网、通讯网、公用事业服务网中 ,给某些设施选择最优地址的时候 ,就把各种网画成图 ,若画成的图是连通的 ,则可以转化为求图的中心和中位点问题。而求图的中心和中位点就必须利用离散数学图论篇的距离矩阵 (D =(dij) ) n×n知识更多还原

【Abstract】 When researching nets of traffic and communication, public service etc,selecting an optimal address for the devices is needed,and a graph for all of the nets can be drawn ou can draw an graph for all of the nets. If the graph is connected,the problem can be transfer to a question through discrete mathematics theory’s distance matrixD=(dij)n×n finding the center or middle point of a graph. (dij)n×n is distance matrix of graph theory in discrete mathematics. This paper investigates the distance matrix’s application in practical engineering.更多还原