Steiner centers and Steiner medians of graphs

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/33604

Title:	Steiner centers and Steiner medians of graphs
Authors:	Yeh,Hong-Gwa;Chiang,Chun-Ying;Peng,Sheng-Hueng
Contributors:	數學研究所
Keywords:	DISTANCE-HEREDITARY GRAPHS
Date:	2008
Issue Date:	2010-07-07 11:39:34 (UTC+8)
Publisher:	中央大學
Abstract:	Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d(G) (S) or d(S). The Steiner n-eccentricity e(n) (v) and Steiner n-distance
Relation:	DISCRETE MATHEMATICS????
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	450	View/Open

社群 sharing