A graph is called simple if there are no loops and there are no multiple edges. Is it possible to compute the number of non-isomorphic, simple, connected graphs with 6 vertices? If the number is known, how we obtain this number? Thank you in advance!
Post Closed as "Not suitable for this site" by Carl-Fredrik Nyberg Brodda, Ira Gessel, Andreas Blass, Jukka Kohonen, Manfred Weis