Title of article
Isometric path numbers of graphs Original Research Article
Author/Authors
Jun-Jie Pan، نويسنده , , Gerard J. Chang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
6
From page
2091
To page
2096
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 image, 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
Isometric path , Complete r-partite graph , Hamming graphs
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948060
Link To Document