4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2022
The geodesic cover problem for butterfly networks
Paul Manuel, Sandi Klavzar, R. Prabha +1
A geodesic cover, also known as an isometric path cover, of a graph is a set of geodesics which cover the vertex set of the graph. An edge geodesic cover of a graph is a set of geo…
math.CO2017★ 4 cited
Strong geodetic problem in networks: computational complexity and solution for Apollonian networks
Paul Manuel, Sandi Klavžar, Antony Xavier +2
The geodetic problem was introduced by Harary et al. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic pro…