On the Steiner medians of a block graph
碩士 === 國立中央大學 === 數學研究所 === 93 === The Steiner distance of an nonempty set of vertices S of a connected graph G is the minimum number of edges of G containing S. Let n �d 2 be an integer and suppose that G has at least n vertices. The Steiner n – distance of a vertex v of G is defined to be the sum...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99323965303558151520 |