For a given undirected graph G, I want to count all the subgraphs H that satisfies the following conditions:
- H.V = G.V (The subgraph will containt all the original graph nodes)
- H is connected
(Note: I don't care if two subgraphs are isomorphic)
The graphs which I will be working with will have |G.V| <= 15
H.V
do you mean the vertices ofH
? $\endgroup$ – Michael Klein Jun 7 '16 at 17:42