Isometric path numbers of graphs

Details Isometric path numbers of graphs Isometric path numbers of graphs

2003-10-21

arxiv.org/abs/math/0310332v1

Mathematics

Combinatorics

9 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 needed to cover all vertices of $G$. In this
paper, we determine exact values of isometric path numbers of complete
$r$-partite graphs and Cartesian products of 2 or 3 complete graphs.

Affiliated with

Also associated with

No associations

Rating

Isometric path numbers of 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 graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isometric path numbers of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510177