8.19:
A kite is a graph on an even number of vertices, say 2n, in which n of the vertices from a clique and the remaining n vertices are connected in a “tail” that consists of a path joined to one of the clique. Given a graph and a goal g, the KITE problem asks for a subgraph which is a kite and which contains 2g nodes. Prove the KITE is NP-complete.
中文翻译:
所谓风筝图是这样的,其顶点数为偶数(2n),且其中的n个顶点构成一个团,剩余的n个顶点则由一条称为“尾巴”的路径连接,尾巴的某个端点与团中一个顶点相连。给定一个图和目标g,风筝图问题要求该图的一个包含2g个顶点的风筝子图。请证明该问题是NP-完全的。
解答:
可以将团问题归约到 KITE 问题。若要求图G(V,E)的大团,可以在图G 中添加 |V | 个新顶点,并将每个新顶点都连向原图中不同的某个顶点,共形成了 V 条新边,这样就得了一个新图G’。容易看出,在 G’ 中存在大小为2g 的kite 当且仅当G 中存在大小为 g 的团。