Question

How to calculate the expected maximum tree size in a pseudoforest

score 992 · Answer 1 · 2015-01-04 07:15:22

992

Views

How to calculate the expected maximum tree size in a pseudoforest

Published on 04 Jan 2015 - 7:15

score 383 · Answer 2 · 2026-03-26 11:04:10

383

Views

About the topology of a $d$-regular tree

Published on 26 Mar 2026 - 11:04

score 258 · Answer 3 · 2015-01-05 15:41:55

258

Views

could a spanning tree graph be expressed by a lower triangular matrix?

Published on 05 Jan 2015 - 15:41

score 4.6k · Answer 4 · 2015-01-06 12:41:34

4.6k

Views

Prim , Kruskal or Dijkstra

Published on 06 Jan 2015 - 12:41

score 943 · Answer 5 · 2015-01-12 09:03:38

943

Views

What does $ \chi(Tree)\leq 2 $ mean in graph theory?

Published on 12 Jan 2015 - 9:03

score 105 · Answer 6 · 2015-01-15 18:40:45

105

Views

Proof of a tree with a vertex of degree k and less than k vertices of degree 1

Published on 15 Jan 2015 - 18:40

score 142 · Answer 7 · 2015-01-16 12:35:49

142

Views

If the inorder traversal of a binary tree produces ordered output, is the tree a binary search tree?

Published on 16 Jan 2015 - 12:35

score 185 · Answer 8 · 2015-01-18 14:16:47

185

Views

Polynomial time algorithm for finding the chromatic sum of a tree.

Published on 18 Jan 2015 - 14:16

score 54 · Answer 9 · 2015-01-19 02:34:38

54

Views

Simple criteria to know if the p-nary notation of an integer can generate a tree by preorder traversing?

Published on 19 Jan 2015 - 2:34

score 2.3k · Answer 10 · 2026-03-28 18:50:16

2.3k

Views

$T(n) = T(n/3) + T(2n/3) + cn$ - recursion tree with constance $c$

Published on 28 Mar 2026 - 18:50

score 206 · Answer 11 · 2015-01-23 14:02:33

206

Views

Graph with fixed amount of spanning trees

Published on 23 Jan 2015 - 14:02

score 936 · Answer 12 · 2015-01-24 05:50:44

936

Views

Prove in any tree with n vertices, the number of nodes with 3 or more neighbors is at most 2(n-1)/3

Published on 24 Jan 2015 - 5:50

score 79 · Answer 13 · 2015-01-24 12:41:16

79

Views

Delete nodes that satisfy a property

Published on 24 Jan 2015 - 12:41

score 3.5k · Answer 14 · 2015-01-24 13:48:41

3.5k

Views

Let $G$ be a connected graph, then $G$ is a tree iff $G$ has no cycles

Published on 24 Jan 2015 - 13:48

score 247 · Answer 15 · 2015-01-24 17:15:08

247

Views

Height of quasi-complete binary tree

Published on 24 Jan 2015 - 17:15

List Question

How to calculate the expected maximum tree size in a pseudoforest

About the topology of a $d$-regular tree

could a spanning tree graph be expressed by a lower triangular matrix?

Prim , Kruskal or Dijkstra

What does $ \chi(Tree)\leq 2 $ mean in graph theory?

Proof of a tree with a vertex of degree k and less than k vertices of degree 1

If the inorder traversal of a binary tree produces ordered output, is the tree a binary search tree?

Polynomial time algorithm for finding the chromatic sum of a tree.

Simple criteria to know if the p-nary notation of an integer can generate a tree by preorder traversing?

$T(n) = T(n/3) + T(2n/3) + cn$ - recursion tree with constance $c$

Graph with fixed amount of spanning trees

Prove in any tree with n vertices, the number of nodes with 3 or more neighbors is at most 2(n-1)/3

Delete nodes that satisfy a property

Let $G$ be a connected graph, then $G$ is a tree iff $G$ has no cycles

Height of quasi-complete binary tree

Trending Questions

Popular # Hahtags

Popular Questions