| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651409 | Discrete Mathematics | 2006 | 6 Pages |
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)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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jun-Jie Pan, Gerard J. Chang,