A107991
Complexity (number of maximal spanning trees) in an unoriented simple graph with nodes {1,2,…,n} and edges {i,j} if i + j > n.
offset: 1
codomain: ℕ
Declarations
Section titled “Declarations”- A107991computable
Complexity (number of maximal spanning trees) in an unoriented simple graph with nodes {1,2,…,n} and edges {i,j} if i + j > n.