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…