Question

Probability of a language chain

score 71 · Answer 1 · 2018-06-23 10:34:35

71

Views

Probability of a language chain

Published on 23 Jun 2018 - 10:34

score 72 · Answer 2 · 2018-06-23 16:25:58

72

Views

Is $\sum\limits_{\{v,w\}\in E(G)}d(v)+d(w) = \sum\limits_{v \in V(G)}d(v)^2$?

Published on 23 Jun 2018 - 16:25

score 112 · Answer 3 · 2026-03-26 11:18:35

112

Views

Does $g_2/(g_1 + 2g_2)^2 = h_2/(h_1 + 2h_2)^2$ have solutions over $\mathbb{N}$ with $g_2 \neq h_2$?

Published on 26 Mar 2026 - 11:18

score 116 · Answer 4 · 2026-03-25 20:35:41

116

Views

Hamiltonian cycle containing each edges of graph

Published on 25 Mar 2026 - 20:35

score 126 · Answer 5 · 2018-06-23 18:53:53

126

Views

tournament $G=(V,E)$ property

Published on 23 Jun 2018 - 18:53

score 270 · Answer 6 · 2026-03-25 06:08:23

270

Views

Realizable automorphism groups of graphs

Published on 25 Mar 2026 - 6:08

score 31 · Answer 7 · 2026-03-26 17:42:30

31

Views

Meaning of Choosing an Edge Incident with the Root of An Isomorphism Class of Rooted Graphs

Published on 26 Mar 2026 - 17:42

score 337 · Answer 8 · 2018-06-24 16:12:30

337

Views

L1 embedding of a cycle

Published on 24 Jun 2018 - 16:12

score 157 · Answer 9 · 2026-03-27 22:52:52

157

Views

minimum number of steps needed for finite ergodic Markov chains to have all positive state transition probability

Published on 27 Mar 2026 - 22:52

score 80 · Answer 10 · 2026-03-25 03:22:23

80

Views

Reference on properties of the queen graph $Q_n$?

Published on 25 Mar 2026 - 3:22

score 89 · Answer 11 · 2026-03-25 10:29:24

89

Views

How to generate a uniform simple path from a rectangular grid graph?

Published on 25 Mar 2026 - 10:29

score 864 · Answer 12 · 2026-03-25 03:21:18

864

Views

Proof that it exists at least one graph G planar, bipartite and with $\delta$(G) $\ge$ 4

Published on 25 Mar 2026 - 3:21

score 240 · Answer 13 · 2026-03-25 21:45:03

240

Views

Properties of minimum spanning trees: a reference

Published on 25 Mar 2026 - 21:45

score 48 · Answer 14 · 2018-06-26 05:39:39

48

Views

For a finite graph $G$ without odd cycles with length at least 5, we have $\chi(G)=\omega(G)$.

Published on 26 Jun 2018 - 5:39

score 69 · Answer 15 · 2018-06-26 06:09:18

69

Views

Classification of graphs for given independence polynomial

Published on 26 Jun 2018 - 6:09

List Question

Probability of a language chain

Is $\sum\limits_{\{v,w\}\in E(G)}d(v)+d(w) = \sum\limits_{v \in V(G)}d(v)^2$?

Does $g_2/(g_1 + 2g_2)^2 = h_2/(h_1 + 2h_2)^2$ have solutions over $\mathbb{N}$ with $g_2 \neq h_2$?

Hamiltonian cycle containing each edges of graph

tournament $G=(V,E)$ property

Realizable automorphism groups of graphs

Meaning of Choosing an Edge Incident with the Root of An Isomorphism Class of Rooted Graphs

L1 embedding of a cycle

minimum number of steps needed for finite ergodic Markov chains to have all positive state transition probability

Reference on properties of the queen graph $Q_n$?

How to generate a uniform simple path from a rectangular grid graph?

Proof that it exists at least one graph G planar, bipartite and with $\delta$(G) $\ge$ 4

Properties of minimum spanning trees: a reference

For a finite graph $G$ without odd cycles with length at least 5, we have $\chi(G)=\omega(G)$.

Classification of graphs for given independence polynomial

Trending Questions

Popular # Hahtags

Popular Questions