Isometric path numbers of graphs
檔案
- 000240421800009.pdf (177.7 KB, Adobe PDF)
日期
2006-09-06
類型
系所
期刊名稱
DISCRETE MATHEMATICS
卷期與頁次
第 306 卷第 17 期,頁 2091–2096
ISSN
0012-365X
語言
英文
摘要
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. (c) 2006 Elsevier B.V. All rights reserved.