4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2021
k-Strong Shortest Path Union Cover for Certain Graphs and Networks
Antony Xavier, Santiagu Theresal, Deepa Mathew +1
The k-distance strong shortest path union cover of a graph is the minimum cardinality among all strong shortest path union cover at distance k of G. In this paper we determine the…
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…