KITE--NP-complete

8.19

A kite is a graph on an even number of vertices, say 2n, in which n of the vertices form a clique and the remaining n vertices are connected in a "tail" that consists of a path joined to one of the vertices 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 that KITE is NP-complete.

sol:

Kite图：2n顶点，n个顶点构成一个团，另外n个顶点有一条“尾巴”路径连接，尾巴端点和团中一个顶点连接。

Kite图问题：给定一个图，目标g，求该图一个2g个顶点的Kite子图

可将最大团问题规约到Kite问题，图G(V, E)中增加|V|个顶点，将这|V|个顶点与G中原有顶点一一对应相连，得到G'。G'有一个2g个顶点的Kite子图当且仅当G中存在大小为g的团，1）G中存在大小为g的团=>G'中形成一个2gKite子图 2）G'中存在2gKite子图=>G中必先存在大小为g的团，所以KITE是NP完全问题。