Centers and Medians in Graphs

博士 === 國立交通大學 === 應用數學研究所 === 82 === Consider a graph G=(V,E). The distance d_G(u,v) from vertex u tortex v in G is the length of a shortest path from u to v. Artex u is a central vertex if the maximum distance from u toother vertex is minimum. The center...

Full description

Bibliographic Details
Main Authors: Hai-Yen Lee, 李海晏
Other Authors: Gerard J. Chang
Format: Others
Language:en_US
Published: 1994
Online Access:http://ndltd.ncl.edu.tw/handle/98208488158836898391