Question

A graph has 29 vertices and 41 edges. What is the minimum number of distinct cycles that this graph could have?

score 221 · Answer 1 · 2026-04-16 08:23:59

221

Views

A graph has 29 vertices and 41 edges. What is the minimum number of distinct cycles that this graph could have?

Published on 16 Apr 2026 - 8:23

score 930 · Answer 2 · 2026-04-16 16:05:48

930

Views

Number of Hamiltonian cycles in incomplete graphs?

Published on 16 Apr 2026 - 16:05

score 514 · Answer 3 · 2026-04-17 08:09:48

514

Views

Proving that removing any two vertices from a 6-regular, graph of order 10 still results in a Hamiltonian graph

Published on 17 Apr 2026 - 8:09

score 50 · Answer 4 · 2026-04-14 19:35:08

50

Views

is it necessary for a graph to have Hamiltonian path if it has a Hamiltonian circuit?

Published on 14 Apr 2026 - 19:35

score 557 · Answer 5 · 2026-04-16 07:26:57

557

Views

Prove a DAG can be obtained by an undirected graph's longest cycle

Published on 16 Apr 2026 - 7:26

score 350 · Answer 6 · 2026-04-10 18:50:10

350

Views

Vocabulary of cycles in graph theory: closed walk, closed trek, closed trail and closed path

Published on 10 Apr 2026 - 18:50

score 42 · Answer 7 · 2026-04-14 22:25:22

42

Views

Are there any software or libraries(in some language) which draws all the planar graphs given the number of vertices?

Published on 14 Apr 2026 - 22:25

score 1.9k · Answer 8 · 2026-04-13 01:21:19

1.9k

Views

What is a spanning path in graph theory?

Published on 13 Apr 2026 - 1:21

score 929 · Answer 9 · 2026-04-14 11:16:11

929

Views

Random graphs with a hamiltonian path

Published on 14 Apr 2026 - 11:16

score 200 · Answer 10 · 2026-04-18 10:14:46

200

Views

Let $G = (V,E)$ be a tree, then $G$ is a caterpillar graph $\iff$ The line graph of $G$ contains a Hamiltonian path.

Published on 18 Apr 2026 - 10:14

score 285 · Answer 11 · 2026-04-15 10:53:50

285

Views

Are there more non-Hamiltonian graph than Hamiltonian on n vertices?

Published on 15 Apr 2026 - 10:53

score 1k · Answer 12 · 2026-04-15 15:09:39

1k

Views

Counting Hamiltonian cycles in a graph

Published on 15 Apr 2026 - 15:09

score 422 · Answer 13 · 2026-05-05 00:43:21

422

Views

Properly stating a decision problem for a Hamiltonian cycle problem

Published on 05 May 2026 - 0:43

score 618 · Answer 14 · 2026-04-22 21:09:20

618

Views

Spiral path on a Penrose tiling

Published on 22 Apr 2026 - 21:09

score 401 · Answer 15 · 2026-04-12 04:00:19

401

Views

How to generate a Penrose tessellation around a given tile?

Published on 12 Apr 2026 - 4:00

List Question

A graph has 29 vertices and 41 edges. What is the minimum number of distinct cycles that this graph could have?

Number of Hamiltonian cycles in incomplete graphs?

Proving that removing any two vertices from a 6-regular, graph of order 10 still results in a Hamiltonian graph

is it necessary for a graph to have Hamiltonian path if it has a Hamiltonian circuit?

Prove a DAG can be obtained by an undirected graph's longest cycle

Vocabulary of cycles in graph theory: closed walk, closed trek, closed trail and closed path

Are there any software or libraries(in some language) which draws all the planar graphs given the number of vertices?

What is a spanning path in graph theory?

Random graphs with a hamiltonian path

Let $G = (V,E)$ be a tree, then $G$ is a caterpillar graph $\iff$ The line graph of $G$ contains a Hamiltonian path.

Are there more non-Hamiltonian graph than Hamiltonian on n vertices?

Counting Hamiltonian cycles in a graph

Properly stating a decision problem for a Hamiltonian cycle problem

Spiral path on a Penrose tiling

How to generate a Penrose tessellation around a given tile?

Trending Questions

Popular # Hahtags

Popular Questions