Question

Consider the following graph G: • Circle the nodes that represent the largest clique in G. • Draw the complement graph $\overline{G}$ (the complement graph $\overline{G}$ has the same nodes as G but if 2 nodes are connected in G then they would not be connected in $\overline{G}$ and if they are not connected G then they would be connected in $\overline{G}$) • Circle the nodes that represent the largest DSI in $\overline{G}$What do you notice? 3 points Use your observations from the previous question to show that DSI is NP-Complete

          Consider the following graph G:
• Circle the nodes that represent the largest clique in G.
• Draw the complement graph $\overline{G}$ (the complement graph $\overline{G}$ has the same nodes as G but if 2 nodes are connected in G then they
would not be connected in $\overline{G}$ and if they are not connected G then they would be connected in $\overline{G}$)
• Circle the nodes that represent the largest DSI in $\overline{G}$What do you notice?

3 points
Use your observations from the previous question to show that DSI is NP-Complete

Consider the following graph G:
• Circle the nodes that represent the largest clique in G.
• Draw the complement graph G (the complement graph G has the same nodes as G but if 2 nodes are connected in G then they
would not be connected in G and if they are not connected G then they would be connected in G)
• Circle the nodes that represent the largest DSI in GWhat do you notice?

3 points
Use your observations from the previous question to show that DSI is NP-Complete

Added by Kimberly B.

Question

Please give Ace some feedback