Title: | Isometric-path numbers of block graphs |
Authors: | Pan, JJ Chang, GJ 應用數學系 Department of Applied Mathematics |
Keywords: | isometric path;block graph;cut-vertex;algorithms |
Issue Date: | 31-Jan-2005 |
Abstract: | 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 |
Journal: | INFORMATION PROCESSING LETTERS |
Volume: | 93 |
Issue: | 2 |
Begin Page: | 99 |
End Page: | 102 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.