Isometric-path numbers of block graphs

  • Authors:

  • Jun-Jie Pan;Gerard J. Chang

  • Affiliations:

  • Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan;Department of Mathematics, National Taiwan University, Taipei 10617, Taiwan and Mathematics Division, National Center for Theoretical Sciences at Taipei, Old Mathematics Building, National Taiwan ...

  • Venue:
  • Information Processing Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.89

Visualization

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.