Isometric and induced path partitions: a new upper bound and a characterization of some extremal graphs

Irena Penev, R. B. Sandeep, D. K. Supraja +1

An \textit{isometric path} is a shortest path between two vertices. An \textit{isometric path partition} (IPP) of a graph $G$ is a set $\mathcal{I}$ of vertex-disjoint isometric pa…