Help needed in a graph problem

Revision en2, by ngk_manh, 2021-07-09 15:12:29

Given N node (numbered 1 to N, It should be noted that the nodes are different from another) (N <= 300) Count the number of graph (which only contain 1 connected component) construct by N node and each node doesn't have > 2 edge

Thanks to anyone for give any idea!

_Sorry because my English_
Tags #graph, #graph theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English ngk_manh 2021-07-09 15:12:29 2
en1 English ngk_manh 2021-07-09 14:47:08 426 Initial revision (published)