Author
Deepa Mathew
results may include different authors with the same name
1 papers
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…