Question

is MST a Steiner tree?

score 2.5k · Answer 1 · 2014-06-05 20:11:43

2.5k

Views

is MST a Steiner tree?

Published on 05 Jun 2014 - 20:11

score 62 · Answer 2 · 2014-06-07 11:57:36

62

Views

Finding the number of spanning trees on a set of vertices.

Published on 07 Jun 2014 - 11:57

score 348 · Answer 3 · 2014-06-10 04:11:03

348

Views

Determine the minimum number of weighings to find the counterfeit coin.

Published on 10 Jun 2014 - 4:11

score 916 · Answer 4 · 2014-06-12 12:26:47

916

Views

Prove that every subgraph of forest has at least one vertex of degree < 2

Published on 12 Jun 2014 - 12:26

score 115 · Answer 5 · 2026-03-25 21:46:13

115

Views

maximizing the inverse degree in a graph

Published on 25 Mar 2026 - 21:46

score 401 · Answer 6 · 2014-06-15 20:53:34

401

Views

Mathematics of genealogical trees

Published on 15 Jun 2014 - 20:53

score 802 · Answer 7 · 2014-06-23 07:03:25

802

Views

Does every "balloon" (dragon, tadpole, canoe paddle) admit a graceful labeling?

Published on 23 Jun 2014 - 7:03

score 53 · Answer 8 · 2026-03-26 04:32:29

53

Views

tree structure on classes of elements in GL_2 over a field with discrete valuation

Published on 26 Mar 2026 - 4:32

score 1.5k · Answer 9 · 2014-07-01 06:01:58

1.5k

Views

Find tree diameter or center

Published on 01 Jul 2014 - 6:01

score 245 · Answer 10 · 2014-07-04 00:06:03

245

Views

Proof on Dyadic Trees [Smullyan: First-Order Logic, chapter 1, section 0]

Published on 04 Jul 2014 - 0:06

score 179 · Answer 11 · 2014-07-04 19:06:57

179

Views

What is the number of labeled caterpillars?

Published on 04 Jul 2014 - 19:06

score 3.5k · Answer 12 · 2014-07-05 06:36:56

3.5k

Views

Prove that there is an edge $e' \in E(T')-E(T)$ such that $T'+e-e'$ and $T-e+e'$ are both spanning trees of $G$.

Published on 05 Jul 2014 - 6:36

score 3.2k · Answer 13 · 2014-07-06 07:07:48

3.2k

Views

For all $1 \leq i < j \leq k$, the subtrees $T_i$ and $T_j$ have a vertex in common. Show that $T$ has a vertex which is in all of the $T_i$.

Published on 06 Jul 2014 - 7:07

score 236 · Answer 14 · 2014-07-06 17:48:36

236

Views

How to compute a marginal probability

Published on 06 Jul 2014 - 17:48

score 216 · Answer 15 · 2014-07-07 09:05:52

216

Views

Number of spanning trees of a graph (behind the formula)

Published on 07 Jul 2014 - 9:05

List Question

is MST a Steiner tree?

Finding the number of spanning trees on a set of vertices.

Determine the minimum number of weighings to find the counterfeit coin.

Prove that every subgraph of forest has at least one vertex of degree < 2

maximizing the inverse degree in a graph

Mathematics of genealogical trees

Does every "balloon" (dragon, tadpole, canoe paddle) admit a graceful labeling?

tree structure on classes of elements in GL_2 over a field with discrete valuation

Find tree diameter or center

Proof on Dyadic Trees [Smullyan: First-Order Logic, chapter 1, section 0]

What is the number of labeled caterpillars?

Prove that there is an edge $e' \in E(T')-E(T)$ such that $T'+e-e'$ and $T-e+e'$ are both spanning trees of $G$.

For all $1 \leq i < j \leq k$, the subtrees $T_i$ and $T_j$ have a vertex in common. Show that $T$ has a vertex which is in all of the $T_i$.

How to compute a marginal probability

Number of spanning trees of a graph (behind the formula)

Trending Questions

Popular # Hahtags

Popular Questions