arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.05975math.CO
收藏

某些图和网络的k-强最短路并覆盖

k-Strong Shortest Path Union Cover for Certain Graphs and Networks

Antony Xavier, Santiagu Theresal, Deepa Mathew, S. Arul Amirtha Raja

摘要:

图的k-距离强最短路并覆盖是指图G中所有距离为k的强最短路并覆盖中的最小基数。本文确定了某些图的2-强最短路径并覆盖,并证明了k-强最短路径并覆盖问题在一般情况下是NP完全的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑