Question

Find the number of trees on $2m$ given vertices in which all vertices have degree $1$ or $3$.

score 769 · Answer 1 · 2019-01-20 13:39:30

769

Views

Find the number of trees on $2m$ given vertices in which all vertices have degree $1$ or $3$.

Published on 20 Jan 2019 - 13:39

score 199 · Answer 2 · 2019-01-21 18:56:04

199

Views

Graph Theory - Trees

Published on 21 Jan 2019 - 18:56

score 1.2k · Answer 3 · 2019-01-24 18:27:16

1.2k

Views

Spanning trees for complete graph

Published on 24 Jan 2019 - 18:27

score 150 · Answer 4 · 2026-03-25 09:25:17

150

Views

Does the Graceful tree conjecture refer to all or only some trees?

Published on 25 Mar 2026 - 9:25

score 682 · Answer 5 · 2026-03-26 04:53:56

682

Views

How can I show that there will be at most $4^{n+1}$ pairwise non-isomorphic trees on $n+1$ vertices?

Published on 26 Mar 2026 - 4:53

score 522 · Answer 6 · 2026-03-25 04:40:37

522

Views

Almost all trees are cospectral (Allen Schwenk's 1973 article)

Published on 25 Mar 2026 - 4:40

score 457 · Answer 7 · 2026-03-25 07:41:38

457

Views

Characteristic polynomial of a tree

Published on 25 Mar 2026 - 7:41

score 640 · Answer 8 · 2026-03-25 09:48:18

640

Views

Generating the $n^{th}$ full binary tree over $N$ labeled leaves

Published on 25 Mar 2026 - 9:48

score 42 · Answer 9 · 2019-02-07 06:29:39

42

Views

Directed Trees Question Help

Published on 07 Feb 2019 - 6:29

score 57 · Answer 10 · 2019-02-09 12:06:44

57

Views

About a proof of a proposition about the spanning tree. I cannot understand.

Published on 09 Feb 2019 - 12:06

score 2.1k · Answer 11 · 2019-02-11 04:50:25

2.1k

Views

Number of unlabeled rooted trees with n vertices and k leaves

Published on 11 Feb 2019 - 4:50

score 79 · Answer 12 · 2019-02-12 07:44:47

79

Views

Minimal Spanning Tree With Algorithms

Published on 12 Feb 2019 - 7:44

score 780 · Answer 13 · 2019-02-12 09:41:06

780

Views

How to calculate binary tree node number and layer number generated from $10^{100}$

Published on 12 Feb 2019 - 9:41

score 294 · Answer 14 · 2019-02-14 19:11:26

294

Views

Can someone check my proof for: If a tree T has maximum degree k, then it has at least k leaves.

Published on 14 Feb 2019 - 19:11

score 1.2k · Answer 15 · 2019-02-15 21:54:29

1.2k

Views

Expected distance between leaf nodes in a binary tree

Published on 15 Feb 2019 - 21:54

List Question

Find the number of trees on $2m$ given vertices in which all vertices have degree $1$ or $3$.

Graph Theory - Trees

Spanning trees for complete graph

Does the Graceful tree conjecture refer to all or only some trees?

How can I show that there will be at most $4^{n+1}$ pairwise non-isomorphic trees on $n+1$ vertices?

Almost all trees are cospectral (Allen Schwenk's 1973 article)

Characteristic polynomial of a tree

Generating the $n^{th}$ full binary tree over $N$ labeled leaves

Directed Trees Question Help

About a proof of a proposition about the spanning tree. I cannot understand.

Number of unlabeled rooted trees with n vertices and k leaves

Minimal Spanning Tree With Algorithms

How to calculate binary tree node number and layer number generated from $10^{100}$

Can someone check my proof for: If a tree T has maximum degree k, then it has at least k leaves.

Expected distance between leaf nodes in a binary tree

Trending Questions

Popular # Hahtags

Popular Questions