๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Centers and Medians of a Graph

โœ Scribed by Edward Minieka

Book ID
120637353
Publisher
INFORMS
Year
1977
Tongue
English
Weight
303 KB
Volume
25
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Steiner centers and Steiner medians of g
Steiner centers and Steiner medians of graphs
โœ Hong-Gwa Yeh; Chun-Ying Chiang; Sheng-Hueng Peng ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB
On Steiner centers and Steiner medians o
On Steiner centers and Steiner medians of graphs
โœ Oellermann, Ortrud R. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 143 KB

Let G be connected graph and S a set of vertices of G. Then a Steiner tree for S is a connected subgraph of G of smallest size (number of edges) that contains S. The size of such a subgraph is called the Steiner distance for S and is denoted by d(S). For a vertex v of G, and integer n, 2 ี… n ี… อ‰V(G)