Isometric-path numbers of block graphs

Details Isometric-path numbers of block graphs Isometric-path numbers of block graphs

2004-07-09

arxiv.org/abs/math/0407168v1

Mathematics

Combinatorics

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Isometric-path numbers of block graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Isometric-path numbers of block graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isometric-path numbers of block graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-726054