k-Strong Shortest Path Union Cover for Certain Graphs and Networks
Antony Xavier, Santiagu Theresal, Deepa Mathew, S. Raja · arXiv (Cornell University) · 2021
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 2-strong shortest path union cover for certain graphs, also we prove that the k-strong shortest path union cover problem, in general, is NP-complete.