An undirected graph a 3-blade-fan if it consists of three cycles C1, C2, and Cs of k nodes each and they all share exactly one node. Hence, the graph has 3k – 2 nodes. The figure below show:s a 3-blade-fan of 16 nodes Given an undirected graph G with n vertices and m edges and an integer k, the FAN problem asks whether or not there exists a subgraph of G which
OR
OR