Isometric path partition: a new upper bound and a characterization of some extremal graphs
Irena Penev, R. B. Sandeep, D. K. Supraja, S. Taruni
TL;DR
The paper introduces a new upper bound for the isometric path partition number $ipp(G)$ in terms of the matching number $\nu(G)$, showing $ipp(G) \le |V(G)|-\nu(G)$ for all graphs. It then fully characterizes connected IPP-extremal graphs: such graphs have a clear block-structure, either all blocks are odd complete graphs or all but one blocks are odd complete graphs with the exceptional even block $B$ satisfying $ipp(B)=|V(B)|-\nu(B)$. These results yield complete descriptions for connected odd IPP-extremal graphs and for extremal block graphs, tying IPP-extremality to classical matching and block properties. The work connects IPP to block graph structure and sets the stage for further investigations into biconnected even IPP-extremal graphs and related algorithmic questions.
Abstract
An $\textit{isometric path}$ is a shortest path between two vertices. An $\textit{isometric path partition}$ (IPP) of a graph $G$ is a set $I$ of vertex-disjoint isometric paths in $G$ that partition the vertices of $G$. The \textit{isometric path partition number} of $G$, denoted by $\text{ipp}(G)$, is the minimum cardinality of an IPP of $G$. In this article, we prove that every graph $G$ satisfies $\text{ipp}(G) \leq |V(G)| - ν(G)$, where $ν(G)$ is matching number of $G$. We further prove that a connected graph $G$ is extremal with respect to this upper bound, i.e.\ satisfies $\text{ipp}(G) = |V(G)| - ν(G)$, if and only if either (i) all blocks of $G$ are odd complete graphs, or (ii) all blocks of $G$ except one are odd complete graphs, and the unique block $B$ of $G$ that is not an odd complete graph is even and satisfy $\text{ipp}(B) = |V(B)| - ν(B)$. As corollaries of this result, we obtain a full structural characterization of all connected odd graphs that are extremal with respect to our upper bound, as well as of all extremal block graphs.