|
|||||
|
|
Isometric path numbers of graphs |
|
| Authors: | Jun-Jie Pan |
| Affiliation: | a Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan b Department of Mathematics, National Taiwan University, Taipei 10617, Taiwan c National Center for Theoretical Sciences, Taipei Office, Taiwan |
| 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. |
| Keywords: | Isometric path Complete r-partite graph Hamming graphs |
| 本文献已被 ScienceDirect 等数据库收录！ | |