k-Strong Shortest Path Union Cover for Certain Graphs and Networks
From MaRDI portal
K-Strong Shortest Path Union Cover for Certain Graphs and Networks
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.
This page was built for publication: k-Strong Shortest Path Union Cover for Certain Graphs and Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6365157)
