Question

Prove that if $deg(u)+deg(v)\geq n$ for every pair $u.v$ of non adjacent vertices of $G$, then $G$ is non-separable.

score 3.1k · Answer 1 · 2026-04-15 19:03:31

Prove that if $deg(u)+deg(v)\geq n$ for every pair $u.v$ of non adjacent vertices of $G$, then $G$ is non-separable.

score 19.4k · Answer 2 · 2026-04-17 07:42:59

19.4k

Views

Prove that every connected graph of all whose vertices have even degree contain no bridges.

Published on 17 Apr 2026 - 7:42

score 238 · Answer 3 · 2026-04-16 04:06:38

238

Views

mapping two graphs

Published on 16 Apr 2026 - 4:06

score 5.1k · Answer 4 · 2026-04-17 06:59:28

5.1k

Views

Length of longest cycle in this graph

Published on 17 Apr 2026 - 6:59

score 6.8k · Answer 5 · 2026-04-17 13:47:50

6.8k

Views

Proving if G is a 3-regular graph, then the size of edge cut equals size of min size of vertex cut

Published on 17 Apr 2026 - 13:47

score 1.6k · Answer 6 · 2026-04-17 13:47:51

Proving G is 3 edge connected if G is connected graph and for every edge $e$, there are cycles $C_1$ and $C_2$ s.t. $E(C_1) \bigcap E(C_2) = \{e\}$

score 526 · Answer 7 · 2026-04-13 01:28:58

Given a node $x$ on a weighted graph, what algorithms are there for finding which node has the shortest path to $x$ from a given list of nodes?

score 807 · Answer 8 · 2026-03-25 05:05:24

807

Views

Understanding and interpreting graph spectra

Published on 25 Mar 2026 - 5:05

score 1k · Answer 9 · 2026-04-14 19:41:39

1k

Views

Is this rule for graph isomorphism true?

Published on 14 Apr 2026 - 19:41

score 222 · Answer 10 · 2026-04-15 19:38:51

222

Views

Every graph G contains a path with d(G) edges (proof critique).

Published on 15 Apr 2026 - 19:38

score 1.5k · Answer 11 · 2026-04-17 14:11:40

1.5k

Views

In complete graph, how can I prove ${n\choose 2} = {k\choose 2} + k(n-k) + {n-k\choose 2}$ for $0 \le k \le n$

Published on 17 Apr 2026 - 14:11

score 117 · Answer 12 · 2026-04-16 02:37:24

117

Views

In a Complete graph, prove $ \sum n_{i} = n, then { n_{i} \choose 2 } \le { n \choose 2 } $

Published on 16 Apr 2026 - 2:37

score 209 · Answer 13 · 2026-04-11 22:28:40

209

Views

What proves clustering preserves DAG property?

Published on 11 Apr 2026 - 22:28

score 71 · Answer 14 · 2026-04-17 05:42:57

71

Views

Generalization of Kneser's graph

Published on 17 Apr 2026 - 5:42

score 57 · Answer 15 · 2026-04-14 17:27:59

57

Views

Is there a layer of abstraction on top of the graph?

Published on 14 Apr 2026 - 17:27

List Question

Prove that if $deg(u)+deg(v)\geq n$ for every pair $u.v$ of non adjacent vertices of $G$, then $G$ is non-separable.

Prove that every connected graph of all whose vertices have even degree contain no bridges.

mapping two graphs

Length of longest cycle in this graph

Proving if G is a 3-regular graph, then the size of edge cut equals size of min size of vertex cut

Proving G is 3 edge connected if G is connected graph and for every edge $e$, there are cycles $C_1$ and $C_2$ s.t. $E(C_1) \bigcap E(C_2) = \{e\}$

Given a node $x$ on a weighted graph, what algorithms are there for finding which node has the shortest path to $x$ from a given list of nodes?

Understanding and interpreting graph spectra

Is this rule for graph isomorphism true?

Every graph G contains a path with d(G) edges (proof critique).

In complete graph, how can I prove ${n\choose 2} = {k\choose 2} + k(n-k) + {n-k\choose 2}$ for $0 \le k \le n$

In a Complete graph, prove $ \sum n_{i} = n, then { n_{i} \choose 2 } \le { n \choose 2 } $

What proves clustering preserves DAG property?

Generalization of Kneser's graph

Is there a layer of abstraction on top of the graph?

Trending Questions

Popular # Hahtags

Popular Questions