Isometric-path numbers of block graphs

Research paper by Jun-Jie Pand, Gerard J. Chang

Indexed on: 09 Jul '04Published on: 09 Jul '04Published in: Mathematics - Combinatorics


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.