Question

Proving a formula for the amount of pendant nodes in a tree

score 70 · Answer 1 · 2026-03-26 11:00:00

70

Views

Proving a formula for the amount of pendant nodes in a tree

Published on 26 Mar 2026 - 11:00

score 167 · Answer 2 · 2026-03-25 10:53:00

167

Views

Riemannian Manifold for the Partial Doubly Stochastic Matrices

Published on 25 Mar 2026 - 10:53

score 333 · Answer 3 · 2026-03-25 09:51:17

333

Views

A convex polyhedron has 20 vertices and 12 faces. Each face of the polyhedron is bounded by the same number of edges. What is this common number?

Published on 25 Mar 2026 - 9:51

score 1.1k · Answer 4 · 2026-03-25 09:51:14

In the simple planar graph G the degree of each vertex is at least 5. Show that in this case G contains at least 12 vertices of degree 5.

score 2k · Answer 5 · 2019-03-06 01:22:43

2k

Views

Tournament with 2n players

Published on 06 Mar 2019 - 1:22

score 539 · Answer 6 · 2026-03-30 17:07:23

539

Views

How in general does one construct a cycle graph for a group?

Published on 30 Mar 2026 - 17:07

score 18 · Answer 7 · 2026-03-23 01:05:04

18

Views

Confusion over Remark about Graph Bisections

Published on 23 Mar 2026 - 1:05

score 26 · Answer 8 · 2019-03-06 12:40:33

26

Views

Choosing vectors that span $\mathbb{R}^n$, with Graph Theory.

Published on 06 Mar 2019 - 12:40

score 53 · Answer 9 · 2026-03-25 15:45:32

53

Views

Adding nodes to graphs while preserving harmonic solution

Published on 25 Mar 2026 - 15:45

score 83 · Answer 10 · 2019-03-06 18:03:10

83

Views

Graph of extra-pairwise relationships

Published on 06 Mar 2019 - 18:03

score 110 · Answer 11 · 2026-03-25 09:49:56

110

Views

Let G be a simple planar graph on 13 vertices. Prove that at least one of G and its complement G is not planar.

Published on 25 Mar 2026 - 9:49

score 83 · Answer 12 · 2026-03-27 12:27:39

83

Views

How can I generate this pattern?

Published on 27 Mar 2026 - 12:27

score 2.3k · Answer 13 · 2026-03-25 09:26:31

2.3k

Views

Show that if $G$ is connected then $L(G)$ is connected

Published on 25 Mar 2026 - 9:26

score 148 · Answer 14 · 2019-03-07 07:24:18

148

Views

Counting paths on a graph

Published on 07 Mar 2019 - 7:24

score 210 · Answer 15 · 2026-03-25 12:26:04

210

Views

Frustration of a weighted bipartite graph

Published on 25 Mar 2026 - 12:26

List Question

Proving a formula for the amount of pendant nodes in a tree

Riemannian Manifold for the Partial Doubly Stochastic Matrices

A convex polyhedron has 20 vertices and 12 faces. Each face of the polyhedron is bounded by the same number of edges. What is this common number?

In the simple planar graph G the degree of each vertex is at least 5. Show that in this case G contains at least 12 vertices of degree 5.

Tournament with 2n players

How in general does one construct a cycle graph for a group?

Confusion over Remark about Graph Bisections

Choosing vectors that span $\mathbb{R}^n$, with Graph Theory.

Adding nodes to graphs while preserving harmonic solution

Graph of extra-pairwise relationships

Let G be a simple planar graph on 13 vertices. Prove that at least one of G and its complement G is not planar.

How can I generate this pattern?

Show that if $G$ is connected then $L(G)$ is connected

Counting paths on a graph

Frustration of a weighted bipartite graph

Trending Questions

Popular # Hahtags

Popular Questions