jump to navigation

Problem of the Day #275: Graphs with Special Cycles December 19, 2011

Posted by Alex in : potd , trackback

An undirected, unweighted graph of $8$ nodes and each edge of the graph is part of exactly one cycle. Find the number of possible graphs.

Comments»

no comments yet - be the first?