Question

If $G$ and $\overline G$ are both $r$-regular then $G$ has odd order.

score 271 · Answer 1 · 2018-10-06 15:52:27

271

Views

If $G$ and $\overline G$ are both $r$-regular then $G$ has odd order.

Published on 06 Oct 2018 - 15:52

score 51 · Answer 2 · 2026-03-29 13:39:20

51

Views

Is there a name for this graph?

Published on 29 Mar 2026 - 13:39

score 182 · Answer 3 · 2018-10-06 16:00:04

182

Views

Does anyone know an optimization problem this problem could be adapted to?

Published on 06 Oct 2018 - 16:00

score 1.2k · Answer 4 · 2018-10-06 17:00:38

1.2k

Views

Find the largest value of k for which the answer to this graph question is yes.

Published on 06 Oct 2018 - 17:00

score 245 · Answer 5 · 2026-03-25 09:24:08

245

Views

Is this theorem about girth and bipartite graph wrong?

Published on 25 Mar 2026 - 9:24

score 1.6k · Answer 6 · 2018-10-06 21:12:35

1.6k

Views

Graph that joins an odd vertex with an even vertex

Published on 06 Oct 2018 - 21:12

score 2.2k · Answer 7 · 2018-10-07 02:31:53

2.2k

Views

Prove or disprove if the graphs $G$ and $H$ are isomorphic

Published on 07 Oct 2018 - 2:31

score 572 · Answer 8 · 2026-03-25 10:52:51

572

Views

Difference between chromatic number and minimal vertex covering

Published on 25 Mar 2026 - 10:52

score 117 · Answer 9 · 2026-03-25 14:22:49

117

Views

Changing the eccentricity of a vertex from $5$ to $4$.

Published on 25 Mar 2026 - 14:22

score 296 · Answer 10 · 2026-03-25 01:36:12

296

Views

Purpose of Cycle and Edge-Cut Vector Spaces?

Published on 25 Mar 2026 - 1:36

score 125 · Answer 11 · 2018-10-08 03:20:23

125

Views

Understanding Lovász Proof that a Critical Graph with $\chi(G) = k + 1 \implies G$ is $k-1$ edge Connected

Published on 08 Oct 2018 - 3:20

score 595 · Answer 12 · 2026-03-25 17:37:36

595

Views

How to choose a $d$-regular graph on $n$ vertices uniformly at random?

Published on 25 Mar 2026 - 17:37

score 523 · Answer 13 · 2026-03-25 14:11:15

523

Views

Algorithm that check if given undirected graph can have Eulerian Cycle by adding edges

Published on 25 Mar 2026 - 14:11

score 534 · Answer 14 · 2026-03-29 19:46:05

534

Views

Heuristic/approximation solutions to Route Inspection/Chinese Postman problem

Published on 29 Mar 2026 - 19:46

score 34 · Answer 15 · 2026-03-29 04:44:00

34

Views

Prove that if $G$ is a simple graph on n vertices such that $\delta(G) \geq \lfloor n/2\rfloor$, then $G$ is connected.

Published on 29 Mar 2026 - 4:44

List Question

If $G$ and $\overline G$ are both $r$-regular then $G$ has odd order.

Is there a name for this graph?

Does anyone know an optimization problem this problem could be adapted to?

Find the largest value of k for which the answer to this graph question is yes.

Is this theorem about girth and bipartite graph wrong?

Graph that joins an odd vertex with an even vertex

Prove or disprove if the graphs $G$ and $H$ are isomorphic

Difference between chromatic number and minimal vertex covering

Changing the eccentricity of a vertex from $5$ to $4$.

Purpose of Cycle and Edge-Cut Vector Spaces?

Understanding Lovász Proof that a Critical Graph with $\chi(G) = k + 1 \implies G$ is $k-1$ edge Connected

How to choose a $d$-regular graph on $n$ vertices uniformly at random?

Algorithm that check if given undirected graph can have Eulerian Cycle by adding edges

Heuristic/approximation solutions to Route Inspection/Chinese Postman problem

Prove that if $G$ is a simple graph on n vertices such that $\delta(G) \geq \lfloor n/2\rfloor$, then $G$ is connected.

Trending Questions

Popular # Hahtags

Popular Questions