Isometric path numbers of graphs
Pan, Jun-Jie · Chang, Gerard J.
Original · EN
An isometric path between two vertices in a graph G is a shortest path joining them. The isometric path number of G, denoted by (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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.