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 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.
Recommendations
Cites work
Cited in
(13)- On graphs coverable by \({k}\) shortest paths
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- Path partition for graphs with special blocks
- The geodesic cover problem for butterfly networks
- A general position problem in graph theory
- Covering and partitioning of split, chain and cographs with isometric paths
- Covering and partitioning of split, chain and cographs with isometric paths
- On the isometric path partition problem
- On the general position number of the k -th power graphs
- Isometric path numbers of graphs
- Parameterizing path partitions
- The isometric path number of a graph
- Fractional isometric path number
This page was built for publication: Isometric-path numbers of block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835002)
