Isometric-path numbers of block graphs

標題:	Isometric-path numbers of block graphs
作者:	Pan, JJ Chang, GJ 應用數學系 Department of Applied Mathematics
關鍵字:	isometric path;block graph;cut-vertex;algorithms
公開日期:	31-一月-2005
摘要:	An isometric path between two vertices in a graph G is a shortest path joining them. The isometric-path number of G, denoted by ip(G), is the minimum number of isometric paths required to cover all vertices of G. In this paper, we determine exact values of isometric-path numbers of block graphs. We also give a linear-time algorithm for finding the corresponding paths. (C) 2004 Elsevier B.V. All rights reserved.
URI:	http://dx.doi.org/10.1016/j.ipl.2004.09.021 http://hdl.handle.net/11536/24063
ISSN:	0020-0190
DOI:	10.1016/j.ipl.2004.09.021
期刊:	INFORMATION PROCESSING LETTERS
Volume:	93
Issue:	2
起始頁:	99
結束頁:	102
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。