Isometric path numbers of graphs

Simple item page
dc.creatorPan, Jun-Jie
dc.creatorChang, Gerard J.
dc.date2003-10-21
dc.date.accessioned2026-07-07T05:02:08Z
dc.date.available2026-07-07T05:02:08Z
dc.descriptionAn 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0310332
dc.identifierhttp://arxiv.org/abs/math/0310332
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68937
dc.subjectCombinatorics
dc.subject05C70; 05C38
dc.titleIsometric path numbers of graphs
dc.typetext

Files

Collections

arXiv