Detour Distance in Graphs
暂无分享,去创建一个
Abstract For vertices u and v in a connected graph G, the detour distance d* (u, v) between u and v is the length of a longest path P for which the subgraph induced by the vertices of P is P itself. A graph G is called a detour graph if d* (u, v) equals the standard distance between u and v in G for every pair u, v of vertices of G. Several results concerning detour distance and detour graphs are presented.
[1] Zevi Miller,et al. On graphs containing a given graph as center , 1981, J. Graph Theory.
[2] Frank Harary,et al. The Dissimilarity Characteristic of Husimi Trees , 1953 .
[3] Peter J. Slater,et al. Medians of arbitrary graphs , 1980, J. Graph Theory.
[4] L. Lesniak. Eccentric sequences in graphs , 1975 .