Question

Algorithm to transform a polytree in a set of trees

score 94 · Answer 1 · 2017-03-17 15:13:28

94

Views

Algorithm to transform a polytree in a set of trees

Published on 17 Mar 2017 - 15:13

score 110 · Answer 2 · 2017-03-17 19:40:32

110

Views

What is the number of trees? tagged trees

Published on 17 Mar 2017 - 19:40

score 1.3k · Answer 3 · 2017-03-20 19:21:43

1.3k

Views

Longest path in a tree with $n$ vertices

Published on 20 Mar 2017 - 19:21

score 9.3k · Answer 4 · 2017-03-21 02:23:34

9.3k

Views

Is my proof that, the number of full nodes plus one is equal to the number of leaves in a nonempty binary tree, correct?

Published on 21 Mar 2017 - 2:23

score 911 · Answer 5 · 2017-03-23 07:34:48

911

Views

For a labelled graph, if the vertex appear $k-1$ times in the Prüfer sequence of the graph, then the vertex has degree $k$

Published on 23 Mar 2017 - 7:34

score 459 · Answer 6 · 2017-03-24 03:03:14

459

Views

Minimum Spanning Tree - True or False

Published on 24 Mar 2017 - 3:03

score 66 · Answer 7 · 2017-03-24 09:40:17

66

Views

What does it mean to order subrees of binary tree by inclusion?

Published on 24 Mar 2017 - 9:40

score 1.4k · Answer 8 · 2017-03-25 20:27:18

1.4k

Views

Binary Trees: relationship between height and number of children

Published on 25 Mar 2017 - 20:27

score 715 · Answer 9 · 2026-03-25 14:04:15

715

Views

Graph Theory - Application of Kirchoff's Matrix Tree Theorem

Published on 25 Mar 2026 - 14:04

score 1.9k · Answer 10 · 2017-03-28 01:35:48

1.9k

Views

Prove the number of spanning trees of $K_{3,m}$ is $3^{m−1}m^2$.

Published on 28 Mar 2017 - 1:35

score 360 · Answer 11 · 2017-03-29 00:56:30

360

Views

# of random walks in a regular tree

Published on 29 Mar 2017 - 0:56

score 785 · Answer 12 · 2017-03-31 00:08:56

785

Views

Every closed walk in a tree uses at least one of its edges at least twice.

Published on 31 Mar 2017 - 0:08

score 513 · Answer 13 · 2017-03-31 13:32:01

513

Views

Graphs: Prove that G has a spanning tree with diameter k

Published on 31 Mar 2017 - 13:32

score 164 · Answer 14 · 2017-04-02 01:32:27

164

Views

Labelled Trees on $n$ vertices

Published on 02 Apr 2017 - 1:32

score 920 · Answer 15 · 2026-03-28 22:28:06

920

Views

How to prove that each tree has at least one leaf on the part with bigger size?

Published on 28 Mar 2026 - 22:28

List Question

Algorithm to transform a polytree in a set of trees

What is the number of trees? tagged trees

Longest path in a tree with $n$ vertices

Is my proof that, the number of full nodes plus one is equal to the number of leaves in a nonempty binary tree, correct?

For a labelled graph, if the vertex appear $k-1$ times in the Prüfer sequence of the graph, then the vertex has degree $k$

Minimum Spanning Tree - True or False

What does it mean to order subrees of binary tree by inclusion?

Binary Trees: relationship between height and number of children

Graph Theory - Application of Kirchoff's Matrix Tree Theorem

Prove the number of spanning trees of $K_{3,m}$ is $3^{m−1}m^2$.

# of random walks in a regular tree

Every closed walk in a tree uses at least one of its edges at least twice.

Graphs: Prove that G has a spanning tree with diameter k

Labelled Trees on $n$ vertices

How to prove that each tree has at least one leaf on the part with bigger size?

Trending Questions

Popular # Hahtags

Popular Questions