Question

how to re-organize the classes

score 54 · Answer 1 · 2026-03-28 08:49:17

54

Views

how to re-organize the classes

Published on 28 Mar 2026 - 8:49

score 74 · Answer 2 · 2026-03-26 16:57:22

74

Views

Can't a path between two non adjacent nodes in a graph be 'undefined', rather than '$\infty$'?

Published on 26 Mar 2026 - 16:57

score 46 · Answer 3 · 2019-04-30 07:55:40

46

Views

How to write the relation for a graph in graph theory?

Published on 30 Apr 2019 - 7:55

score 181 · Answer 4 · 2026-04-10 17:14:08

181

Views

Closed form of summation

Published on 10 Apr 2026 - 17:14

score 3.3k · Answer 5 · 2026-03-25 13:57:53

3.3k

Views

Proof that if graph has $\frac{(n-1)(n-2)}{2} + 2$ edged then contains hamiltonian cycle

Published on 25 Mar 2026 - 13:57

score 296 · Answer 6 · 2019-04-30 14:34:41

296

Views

maximum number of maximal independent set in a graph with n vertices

Published on 30 Apr 2019 - 14:34

score 97 · Answer 7 · 2026-03-26 14:19:23

97

Views

Counting certain graphs defined over consecutive sets of natural numbers

Published on 26 Mar 2026 - 14:19

score 41 · Answer 8 · 2026-04-10 14:30:18

41

Views

Getting inequality from statement

Published on 10 Apr 2026 - 14:30

score 144 · Answer 9 · 2026-03-25 13:04:47

144

Views

Implementing Creative Reidemeister Type II Moves

Published on 25 Mar 2026 - 13:04

score 210 · Answer 10 · 2019-05-01 09:47:24

210

Views

Possible list of exactly $k$ handshakes between $n$ people

Published on 01 May 2019 - 9:47

score 246 · Answer 11 · 2019-05-01 12:50:01

246

Views

Homeomorphic Graph Definition

Published on 01 May 2019 - 12:50

score 210 · Answer 12 · 2019-05-01 14:59:08

210

Views

On proof of upper bound on vertex cover of a connected graph

Published on 01 May 2019 - 14:59

score 191 · Answer 13 · 2019-05-01 20:04:44

191

Views

Prove that one cannot find a minimum spanning tree in which all vertices have degree less than or equal to 2

Published on 01 May 2019 - 20:04

score 588 · Answer 14 · 2026-03-25 17:42:26

Give a counter example to show that if $G$ and $H$ are both Eulerian but only one is connected, then the cartesian product is not Eulerian

score 73 · Answer 15 · 2026-03-25 07:46:08

73

Views

Spectral gap of Cayley graph of $S_n$ with transpositions is $2/n$.

Published on 25 Mar 2026 - 7:46

List Question

how to re-organize the classes

Can't a path between two non adjacent nodes in a graph be 'undefined', rather than '$\infty$'?

How to write the relation for a graph in graph theory?

Closed form of summation

Proof that if graph has $\frac{(n-1)(n-2)}{2} + 2$ edged then contains hamiltonian cycle

maximum number of maximal independent set in a graph with n vertices

Counting certain graphs defined over consecutive sets of natural numbers

Getting inequality from statement

Implementing Creative Reidemeister Type II Moves

Possible list of exactly $k$ handshakes between $n$ people

Homeomorphic Graph Definition

On proof of upper bound on vertex cover of a connected graph

Prove that one cannot find a minimum spanning tree in which all vertices have degree less than or equal to 2

Give a counter example to show that if $G$ and $H$ are both Eulerian but only one is connected, then the cartesian product is not Eulerian

Spectral gap of Cayley graph of $S_n$ with transpositions is $2/n$.

Trending Questions

Popular # Hahtags

Popular Questions