Complexity (number of maximal spanning trees) in an unoriented simple graph with nodes {1,2,..,n} and edges {i,j} if i+j>n. (Q100194040)
Jump to navigation
Jump to search
No description defined
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity (number of maximal spanning trees) in an unoriented simple graph with nodes {1,2,..,n} and edges {i,j} if i+j>n. |
No description defined |