k-Strong Shortest Path Union Cover for Certain Graphs and Networks
Combinatorics
2021-04-14 v1
Abstract
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.
Cite
@article{arxiv.2104.05975,
title = {k-Strong Shortest Path Union Cover for Certain Graphs and Networks},
author = {Antony Xavier and Santiagu Theresal and Deepa Mathew and S. Arul Amirtha Raja},
journal= {arXiv preprint arXiv:2104.05975},
year = {2021}
}