2000 character limit reached
k-Strong Shortest Path Union Cover for Certain Graphs and Networks (2104.05975v1)
Published 13 Apr 2021 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.