Question

Difference between a tree and spanning tree?!

score 20.6k · Answer 1 · 2014-02-05 10:27:35

20.6k

Views

Difference between a tree and spanning tree?!

Published on 05 Feb 2014 - 10:27

score 12.4k · Answer 2 · 2014-02-05 13:55:44

12.4k

Views

Number of nodes in binary tree given number of leaves

Published on 05 Feb 2014 - 13:55

score 11.8k · Answer 3 · 2014-02-07 05:05:18

11.8k

Views

How many different spanning trees of $K_n \setminus e$ are there?

Published on 07 Feb 2014 - 5:05

score 243 · Answer 4 · 2026-03-30 16:41:41

243

Views

Proofs with binary trees

Published on 30 Mar 2026 - 16:41

score 1.4k · Answer 5 · 2014-02-10 18:08:01

1.4k

Views

The complement of spanning trees is covered by a union of cycles

Published on 10 Feb 2014 - 18:08

score 1.7k · Answer 6 · 2014-02-11 15:24:17

1.7k

Views

Finding a spanning tree using exactly k red edges in a graph with edges colored by red/blue in linear time.

Published on 11 Feb 2014 - 15:24

score 275 · Answer 7 · 2014-02-11 16:01:13

275

Views

Finding the parent of a node in recombining binomial tree

Published on 11 Feb 2014 - 16:01

score 1.1k · Answer 8 · 2014-02-14 14:26:21

1.1k

Views

Proof that spanning trees can be converted into one another

Published on 14 Feb 2014 - 14:26

score 149 · Answer 9 · 2014-02-18 12:30:00

149

Views

Proof of existing path on Depth-First-Search spanning tree

Published on 18 Feb 2014 - 12:30

score 180 · Answer 10 · 2014-02-18 13:18:35

180

Views

Some questions about first-order logic (arising from a book by Raymond M Smullyan)

Published on 18 Feb 2014 - 13:18

score 920 · Answer 11 · 2014-02-19 13:35:39

920

Views

Find Minimal Spanning Tree Using Prim's Algorith

Published on 19 Feb 2014 - 13:35

score 473 · Answer 12 · 2014-02-23 21:03:20

473

Views

Finding graphs with a given number of spanning trees

Published on 23 Feb 2014 - 21:03

score 368 · Answer 13 · 2014-02-26 10:56:12

368

Views

Graph G with two Spanning Trees

Published on 26 Feb 2014 - 10:56

score 495 · Answer 14 · 2014-02-26 22:24:58

495

Views

What's an efficient algorithm for walking to a minimum spanning tree?

Published on 26 Feb 2014 - 22:24

score 3.8k · Answer 15 · 2014-02-27 02:59:59

A tree $T$ with 50 end-vertices has an equal number of vertices of degree 2, 3, 4, and 5 but contains no vertices of degree greater than 5.

List Question

Difference between a tree and spanning tree?!

Number of nodes in binary tree given number of leaves

How many different spanning trees of $K_n \setminus e$ are there?

Proofs with binary trees

The complement of spanning trees is covered by a union of cycles

Finding a spanning tree using exactly k red edges in a graph with edges colored by red/blue in linear time.

Finding the parent of a node in recombining binomial tree

Proof that spanning trees can be converted into one another

Proof of existing path on Depth-First-Search spanning tree

Some questions about first-order logic (arising from a book by Raymond M Smullyan)

Find Minimal Spanning Tree Using Prim's Algorith

Finding graphs with a given number of spanning trees

Graph G with two Spanning Trees

What's an efficient algorithm for walking to a minimum spanning tree?

A tree $T$ with 50 end-vertices has an equal number of vertices of degree 2, 3, 4, and 5 but contains no vertices of degree greater than 5.

Trending Questions

Popular # Hahtags

Popular Questions