Question

Proving Cayley's formula by counting the spanning trees with $deg_{T}(n)=k$

score 427 · Answer 1 · 2019-10-02 09:40:13

427

Views

Proving Cayley's formula by counting the spanning trees with $deg_{T}(n)=k$

Published on 02 Oct 2019 - 9:40

score 128 · Answer 2 · 2026-03-26 12:57:52

128

Views

Amalgamated subgroup of HNN extension is finitely generated

Published on 26 Mar 2026 - 12:57

score 42 · Answer 3 · 2019-10-09 15:44:12

42

Views

Reconstructing (rooted) trees from partial (rooted) subtrees

Published on 09 Oct 2019 - 15:44

score 511 · Answer 4 · 2019-10-12 13:00:40

511

Views

Show that $|E(G)| = |V(G)| - \omega(G) \Rightarrow G$ is a forest

Published on 12 Oct 2019 - 13:00

score 591 · Answer 5 · 2026-03-25 20:34:45

591

Views

How to generate all unique acyclic graphs (trees) given n nodes.

Published on 25 Mar 2026 - 20:34

score 144 · Answer 6 · 2026-03-27 17:34:06

144

Views

Number of closed walks on a regular graph

Published on 27 Mar 2026 - 17:34

score 29 · Answer 7 · 2019-10-16 22:52:36

29

Views

Question about spanning trees

Published on 16 Oct 2019 - 22:52

score 717 · Answer 8 · 2019-10-19 15:00:47

717

Views

How do I derive the game matrix in this game theory experiment?

Published on 19 Oct 2019 - 15:00

score 901 · Answer 9 · 2019-10-20 13:05:35

901

Views

Are there a finite number of trees with $k$ leaves and no vertices of degree $2$?

Published on 20 Oct 2019 - 13:05

score 84 · Answer 10 · 2019-10-21 19:41:08

84

Views

Check whether two trees given by their adjacency matrices are isomorphic

Published on 21 Oct 2019 - 19:41

score 83 · Answer 11 · 2019-10-25 10:45:08

83

Views

100 row numbers to find the shortest path

Published on 25 Oct 2019 - 10:45

score 1.4k · Answer 12 · 2019-11-02 12:52:42

1.4k

Views

Question Let $T=(V,E)$ be a tree with exactly 3 leaves, and $n$ vertices, as $n\ge 5$. Prove the following

Published on 02 Nov 2019 - 12:52

score 94 · Answer 13 · 2019-11-03 21:42:56

94

Views

Complexity Of A Recurrence Summation.

Published on 03 Nov 2019 - 21:42

score 42 · Answer 14 · 2019-11-04 01:32:25

42

Views

Draw a tree with $4$ vertices of grade $5$, $8$ of grade $4$, $6$ of grade $3$, $10$ of grade $2$ and $36$ of grade $1$

Published on 04 Nov 2019 - 1:32

score 1.5k · Answer 15 · 2019-11-06 11:24:01

1.5k

Views

A graph is a tree iff any 2 vertices are connected by a unique path (Proof Verification)

Published on 06 Nov 2019 - 11:24

List Question

Proving Cayley's formula by counting the spanning trees with $deg_{T}(n)=k$

Amalgamated subgroup of HNN extension is finitely generated

Reconstructing (rooted) trees from partial (rooted) subtrees

Show that $|E(G)| = |V(G)| - \omega(G) \Rightarrow G$ is a forest

How to generate all unique acyclic graphs (trees) given n nodes.

Number of closed walks on a regular graph

Question about spanning trees

How do I derive the game matrix in this game theory experiment?

Are there a finite number of trees with $k$ leaves and no vertices of degree $2$?

Check whether two trees given by their adjacency matrices are isomorphic

100 row numbers to find the shortest path

Question Let $T=(V,E)$ be a tree with exactly 3 leaves, and $n$ vertices, as $n\ge 5$. Prove the following

Complexity Of A Recurrence Summation.

Draw a tree with $4$ vertices of grade $5$, $8$ of grade $4$, $6$ of grade $3$, $10$ of grade $2$ and $36$ of grade $1$

A graph is a tree iff any 2 vertices are connected by a unique path (Proof Verification)

Trending Questions

Popular # Hahtags

Popular Questions