List questions from graph-theory

Published on 10 Apr 2026 - 11:47

73

Views

Graph Theory (Edges and coloring)

Published on 17 Apr 2026 - 0:48

131

Views

Graph Theory Coloring

Published on 16 Apr 2026 - 17:33

11k

Views

Stationary distribution of random walk on a graph

Published on 11 Apr 2026 - 13:36

499

Views

Graph theory problem - the number of common acquaintances

Published on 16 Apr 2026 - 14:52

1k

Views

Lower bound on counting perfect matchings in bipartite graph

Published on 16 Apr 2026 - 14:58

28

Views

Do these algorithms to construct the graphs with a particular property have any importance?

Published on 15 Apr 2026 - 0:08

175

Views

Nearest neighbor problem

Published on 12 Apr 2026 - 5:59

1.9k

Views

Calculating the average degree/valency of vertices

Published on 11 Apr 2026 - 0:32

58

Views

The number of spanning trees in a simple graph with no cut edges

Published on 16 Apr 2026 - 5:34

277

Views

Cycles of maximum length in a non-separable graph G.

Published on 16 Apr 2026 - 15:22

492

Views

Proof for corollary of non-separable graph

Published on 13 Apr 2026 - 8:03

2.9k

Views

A certain tree $T$ of order $n$ contains only vertices of degree $1$ and $3$. Show that $T$ contain $\frac{n-2}{2}$ vertices of degree $3$.

Published on 16 Apr 2026 - 2:25

2.2k

Views

Prove that a graph $G$ is a forest if and only if every induced subgraph of $G$ contain a vertex of degree at most $1$

Published on 16 Apr 2026 - 11:58

216

Views

Find the degree of remaining verticies

Published on 13 Apr 2026 - 23:17

List Question

Finding a minimum weight spanning tree?

Graph Theory (Edges and coloring)

Graph Theory Coloring

Stationary distribution of random walk on a graph

Graph theory problem - the number of common acquaintances

Lower bound on counting perfect matchings in bipartite graph

Do these algorithms to construct the graphs with a particular property have any importance?

Nearest neighbor problem

Calculating the average degree/valency of vertices

The number of spanning trees in a simple graph with no cut edges

Cycles of maximum length in a non-separable graph G.

Proof for corollary of non-separable graph

A certain tree $T$ of order $n$ contains only vertices of degree $1$ and $3$. Show that $T$ contain $\frac{n-2}{2}$ vertices of degree $3$.

Prove that a graph $G$ is a forest if and only if every induced subgraph of $G$ contain a vertex of degree at most $1$

Find the degree of remaining verticies

Trending Questions

Popular # Hahtags

Popular Questions