Isometric-path numbers of block graphs

Simple item page
dc.creatorPand, Jun-Jie
dc.creatorChang, Gerard J.
dc.date2004-07-09
dc.date.accessioned2026-07-07T05:10:09Z
dc.date.available2026-07-07T05:10:09Z
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 required to cover all vertices of G. In this paper, we determine exact values of isometric-path numbers of block graphs. We also give a linear-time algorithm for finding the corresponding paths.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0407168
dc.identifierhttp://arxiv.org/abs/math/0407168
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71841
dc.subjectCombinatorics
dc.subject05C70
dc.titleIsometric-path numbers of block graphs
dc.typetext

Files

Collections

arXiv