I would like to count the number of undirected simple and connected graphs with $2k$ different vertex so there is a an one and only edge that if will remove it, the graph will be build of two disconnected graphs $G_1,G_2$ so they are both complete graphs?
How can I approach this issue?