Opening book details…
Can I read Isometric-path Numbers of Block Graphs on EtoBox?
Isometric-path Numbers of Block Graphs by Pand, Jun-Jie; Chang, Gerard J. is a scholarly article available to read on EtoBox.
What is Isometric-path Numbers of Block Graphs about?
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.
- Author
- Pand, Jun-Jie; Chang, Gerard J.
- Published
- 2004
- Language
- EN