Isometric path numbers of graphs
Resource
Discrete Mathematics 306,2091-2096
Journal
Discrete Mathematics 306
Pages
2091-2096
Date Issued
2006-04
Date
2006-04
Author(s)
Pan, Jun-Jie
Chang, Gerard-J.
DOI
246246/2006111501244135
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 & Cartesian products of 2 or 3 complete graphs.
Subjects
Isometric path
Complete r-partite graph
Hamming graphs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
318.pdf
Size
23.18 KB
Format
Adobe PDF
Checksum
(MD5):68fc8e9a911934e51637dc989adc179a