Question

possible contradiction to Cayley's formula (how many possible labeled trees with n vertices)

score 175 · Answer 1 · 2019-02-20 22:48:16

175

Views

possible contradiction to Cayley's formula (how many possible labeled trees with n vertices)

Published on 20 Feb 2019 - 22:48

score 50 · Answer 2 · 2019-02-21 10:20:12

50

Views

Proving $k(G) \leq k'(G) $ where $k(G)$ is the minumum vertex cut and $k'(G)$ is minimum edge cut.

Published on 21 Feb 2019 - 10:20

score 47 · Answer 3 · 2026-03-30 04:56:44

47

Views

Definition of a network in Graph Theory (Complex Networks)

Published on 30 Mar 2026 - 4:56

score 261 · Answer 4 · 2019-02-21 16:47:29

261

Views

Graph colouring problem

Published on 21 Feb 2019 - 16:47

score 135 · Answer 5 · 2026-03-25 03:17:11

135

Views

sampling a connected graph to a smaller connected graph

Published on 25 Mar 2026 - 3:17

score 1.1k · Answer 6 · 2019-02-21 21:35:33

Let $G$ be a $k$-regular graph, with $|V(G)|$ even, that remains connected when any $k − 2$ edges are deleted. Prove that $G$ has a $1$-factor.

score 637 · Answer 7 · 2019-02-22 06:54:21

A noncomplete graph $H$ of order $5$ or more with the property that $deg (u) ≠ deg (v)$ for every pair $u, v$ of nonadjacent vertices of $H$.

score 1.1k · Answer 8 · 2019-02-22 07:59:02

Prove that if a graph of order $3n (n ≥ 1)$ has $n$ vertices of each of the degrees $n − 1$, $n$ and $n + 1$, then n is even.

score 104 · Answer 9 · 2019-02-22 09:37:41

Is there any chance to reconstruct a BFS tree after removing one of its edges less expensively than repeat the complete spanning tree search?

score 677 · Answer 10 · 2026-03-30 05:02:01

677

Views

Definition of Path in Graph Theory

Published on 30 Mar 2026 - 5:02

score 609 · Answer 11 · 2019-02-22 15:58:43

609

Views

Proof: We have a graph where all nodes have an even degree, then the graph is 2-edge-connected.

Published on 22 Feb 2019 - 15:58

score 427 · Answer 12 · 2026-03-26 10:58:37

427

Views

Transient random walk on 3-color 3-regular tree

Published on 26 Mar 2026 - 10:58

score 59 · Answer 13 · 2019-02-22 21:20:58

59

Views

2-vertex-connected Graph must contain a cycle

Published on 22 Feb 2019 - 21:20

score 427 · Answer 14 · 2019-02-22 23:22:00

427

Views

A proper Vertex, Edge, and Face coloring of a surface Graph

Published on 22 Feb 2019 - 23:22

score 1k · Answer 15 · 2019-02-23 01:00:34

1k

Views

Number of Vertices in a Self-Complementary Graph

Published on 23 Feb 2019 - 1:00

List Question

possible contradiction to Cayley's formula (how many possible labeled trees with n vertices)

Proving $k(G) \leq k'(G) $ where $k(G)$ is the minumum vertex cut and $k'(G)$ is minimum edge cut.

Definition of a network in Graph Theory (Complex Networks)

Graph colouring problem

sampling a connected graph to a smaller connected graph

Let $G$ be a $k$-regular graph, with $|V(G)|$ even, that remains connected when any $k − 2$ edges are deleted. Prove that $G$ has a $1$-factor.

A noncomplete graph $H$ of order $5$ or more with the property that $deg (u) ≠ deg (v)$ for every pair $u, v$ of nonadjacent vertices of $H$.

Prove that if a graph of order $3n (n ≥ 1)$ has $n$ vertices of each of the degrees $n − 1$, $n$ and $n + 1$, then n is even.

Is there any chance to reconstruct a BFS tree after removing one of its edges less expensively than repeat the complete spanning tree search?

Definition of Path in Graph Theory

Proof: We have a graph where all nodes have an even degree, then the graph is 2-edge-connected.

Transient random walk on 3-color 3-regular tree

2-vertex-connected Graph must contain a cycle

A proper Vertex, Edge, and Face coloring of a surface Graph

Number of Vertices in a Self-Complementary Graph

Trending Questions

Popular # Hahtags

Popular Questions