Isometric path numbers of graphs
Journal
Discrete Mathematics
Journal Volume
306
Journal Issue
17
Pages
2091-2096
Date Issued
2006
Author(s)
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 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. © 2006 Elsevier B.V. All rights reserved.
Type
journal article