## I.Sahul Hamid, H.Shanmuga Priya and A.Anitha, Simple Geodesic Path Covers and Helly Property, Volume 2017, Number 3, Pages 34-39, 2017

Abstract: A \emph{simple geodesic path cover} $\mathcal{SGPC}$ of a graph $G$ is a decomposition of $G$ into shortest paths such that any two members of the decomposition share at most one vertex. The minimum cardinality of a simple geodesic path cover of $G$ is called...