Answers are grounded in this paper and cite their sources.
It is well-known that the complement of a disconnected graph is connected, that is, the number of disconnected unlabeled graphs whose complement is also disconnected is zero. By this fact, we can easily express the number of connected unlabeled graphs whose complement is also connected, by the numbers of graphs and connected graphs. The generating functions of them are obtained by Harary [5]. In this paper, we express the number of unlabeled graphs such that both the graph and its complement are 2-connected, by the numbers of graphs whose generating functions are known.
No takes yet. Share an insight, caveat, or question.
Kobata et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: