Question

number of trees with 10 node

score 55 · Answer 1 · 2024-02-20 09:39:38

55

Views

number of trees with 10 node

Published on 20 Feb 2024 - 9:39

score 71 · Answer 2 · 2024-02-21 10:36:46

71

Views

Avoiding binary tree duplicates

Published on 21 Feb 2024 - 10:36

score 49 · Answer 3 · 2026-03-27 07:49:46

49

Views

Lattice corresponding to the incidence matrix of a weighted tree is indecomposable

Published on 27 Mar 2026 - 7:49

score 106 · Answer 4 · 2024-02-29 19:57:04

We have a tree T on n vertices. Prove that the centre of the tree T is isomorphic to a complete graph on 2 vertices if and only if diam(T)=2*rad(T)-1

score 38 · Answer 5 · 2026-03-25 23:51:45

38

Views

Closed subgroup of automorphisms of a rooted tree

Published on 25 Mar 2026 - 23:51

score 51 · Answer 6 · 2024-03-06 08:16:44

51

Views

Moon's Proof of Matrix-Tree Theorem

Published on 06 Mar 2024 - 8:16

score 36 · Answer 7 · 2024-03-09 16:11:42

36

Views

How many non-isomorphic, non-labelled, forests are there (asymptotically) on $n$ vertices?

Published on 09 Mar 2024 - 16:11

score 94 · Answer 8 · 2026-03-25 13:53:36

94

Views

Is $\text{BRANCH}(n)$ finite for $n > 2$?

Published on 25 Mar 2026 - 13:53

score 45 · Answer 9 · 2026-03-25 16:00:05

45

Views

How does making a spanning tree solution "strongly feasible" for the Network Simplex method assist in cycling prevention?

Published on 25 Mar 2026 - 16:00

score 75 · Answer 10 · 2026-03-29 20:21:29

75

Views

Free and cocompact subgroup of the group of automorphisms on a tree

Published on 29 Mar 2026 - 20:21

score 30 · Answer 11 · 2024-03-17 13:13:27

30

Views

Maximum edge cover by paths defined by 3 vertices in a tree

Published on 17 Mar 2024 - 13:13

score 51 · Answer 12 · 2024-03-21 13:35:15

51

Views

Show that every finite and undirected tree has either one or two adjacent centres.

Published on 21 Mar 2024 - 13:35

score 61 · Answer 13 · 2024-03-24 17:30:48

61

Views

Prove that max number of edge-disjoint cycles in a graph is at least $(|E(G)| - |V(G)|)/2\lfloor \log_2(n+1)\rfloor$

Published on 24 Mar 2024 - 17:30

score 26 · Answer 14 · 2026-03-28 13:27:24

26

Views

MST vs SPT for a 2 vertex graph

Published on 28 Mar 2026 - 13:27

score 34 · Answer 15 · 2024-03-31 13:19:39

34

Views

Number of spanning trees that contain a given edge and spanning trees that contain subtrees

Published on 31 Mar 2024 - 13:19

List Question

number of trees with 10 node

Avoiding binary tree duplicates

Lattice corresponding to the incidence matrix of a weighted tree is indecomposable

We have a tree T on n vertices. Prove that the centre of the tree T is isomorphic to a complete graph on 2 vertices if and only if diam(T)=2*rad(T)-1

Closed subgroup of automorphisms of a rooted tree

Moon's Proof of Matrix-Tree Theorem

How many non-isomorphic, non-labelled, forests are there (asymptotically) on $n$ vertices?

Is $\text{BRANCH}(n)$ finite for $n > 2$?

How does making a spanning tree solution "strongly feasible" for the Network Simplex method assist in cycling prevention?

Free and cocompact subgroup of the group of automorphisms on a tree

Maximum edge cover by paths defined by 3 vertices in a tree

Show that every finite and undirected tree has either one or two adjacent centres.

Prove that max number of edge-disjoint cycles in a graph is at least $(|E(G)| - |V(G)|)/2\lfloor \log_2(n+1)\rfloor$

MST vs SPT for a 2 vertex graph

Number of spanning trees that contain a given edge and spanning trees that contain subtrees

Trending Questions

Popular # Hahtags

Popular Questions