Question

Can Kruskal's and Prim's algorithm give trees with different weight?

score 176 · Answer 1 · 2026-03-30 02:05:51

176

Views

Can Kruskal's and Prim's algorithm give trees with different weight?

Published on 30 Mar 2026 - 2:05

score 1.2k · Answer 2 · 2026-03-30 12:56:03

1.2k

Views

trees are bipartite

Published on 30 Mar 2026 - 12:56

score 388 · Answer 3 · 2020-11-14 02:36:33

388

Views

Sequence of positive integers being degree sequence of tree.

Published on 14 Nov 2020 - 2:36

score 772 · Answer 4 · 2026-03-27 06:04:58

772

Views

smallest number of vertices of degree $1$ in tree with $3$ vertices of degree $4$ and $2$ of degree $5$

Published on 27 Mar 2026 - 6:04

score 256 · Answer 5 · 2026-03-27 05:58:52

256

Views

Smallest number of vertices in tree with specific degrees.

Published on 27 Mar 2026 - 5:58

score 813 · Answer 6 · 2020-11-17 15:58:45

813

Views

how to prove helly property of a tree

Published on 17 Nov 2020 - 15:58

score 133 · Answer 7 · 2026-03-29 14:18:52

133

Views

Generate random trees without degree-2 vertices

Published on 29 Mar 2026 - 14:18

score 82 · Answer 8 · 2020-11-21 01:40:50

82

Views

Graph theory and degree of vertex

Published on 21 Nov 2020 - 1:40

score 66 · Answer 9 · 2020-11-21 04:58:45

Prove that in any binary tree with $n \geq 1$ nodes, there exists a node with at least $\frac{n}{3}$ and at most $\frac{(2n + 1)}{3}$ descendants

score 1.2k · Answer 10 · 2020-11-21 11:59:20

1.2k

Views

How to derive the recursive equation for number of binary trees with 'n' nodes?

Published on 21 Nov 2020 - 11:59

score 429 · Answer 11 · 2020-11-21 12:34:35

429

Views

A tree is a connected graph with maximum possible vertices if given the number of edges?

Published on 21 Nov 2020 - 12:34

score 1.6k · Answer 12 · 2020-11-24 03:40:39

1.6k

Views

A tree on 5 vertices of which two are of degree three?

Published on 24 Nov 2020 - 3:40

score 99 · Answer 13 · 2026-03-31 09:14:21

99

Views

shortest path not changed if one of formula is used to update all weights

Published on 31 Mar 2026 - 9:14

score 119 · Answer 14 · 2020-11-25 15:05:10

119

Views

Free group of rank-$2$ has no non-trivial abelian normal subgroup

Published on 25 Nov 2020 - 15:05

score 355 · Answer 15 · 2020-11-29 04:01:37

355

Views

Graphs in which the degree of every vertex is at least 3

Published on 29 Nov 2020 - 4:01

List Question

Can Kruskal's and Prim's algorithm give trees with different weight?

trees are bipartite

Sequence of positive integers being degree sequence of tree.

smallest number of vertices of degree $1$ in tree with $3$ vertices of degree $4$ and $2$ of degree $5$

Smallest number of vertices in tree with specific degrees.

how to prove helly property of a tree

Generate random trees without degree-2 vertices

Graph theory and degree of vertex

Prove that in any binary tree with $n \geq 1$ nodes, there exists a node with at least $\frac{n}{3}$ and at most $\frac{(2n + 1)}{3}$ descendants

How to derive the recursive equation for number of binary trees with 'n' nodes?

A tree is a connected graph with maximum possible vertices if given the number of edges?

A tree on 5 vertices of which two are of degree three?

shortest path not changed if one of formula is used to update all weights

Free group of rank-$2$ has no non-trivial abelian normal subgroup

Graphs in which the degree of every vertex is at least 3

Trending Questions

Popular # Hahtags

Popular Questions