Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Determine whether a graph is connected after deleting all possible sets of specific size.

I have a graph of 60 vertices. I want to delete the vertices {u, v, N(u), N(v)} and check whether the resulting graph is connected, where u and v are vertices and N(u) and N(v) are their corresponding neighbors.

How can I write a code that covers all the possibilities?