Isometric-path numbers of block graphs
Combinatorics
2007-05-23 v1
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
Cite
@article{arxiv.math/0407168,
title = {Isometric-path numbers of block graphs},
author = {Jun-Jie Pand and Gerard J. Chang},
journal= {arXiv preprint arXiv:math/0407168},
year = {2007}
}
Comments
7 pages