| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332159 | Information Processing Letters | 2005 | 4 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jun-Jie Pan, Gerard J. Chang,